DIGITAL LOGIC DESIGN
(LAB-PROJECT)
4-BIT BINARY CALCULATOR
BY:
Umme-Farwa (FA21-BEE-034)
Abul-Rahman (FA21-BEE-086)
Abdullah Fayyaz Abbasi (FA21-BEE-015)
CONTENTS
• INTRODUCTION APPRATUS
WORKING DIAGRAM/TRUTH TABLE
EXPECTED OUTCOME CONCLUSIONS
INTRODUCTION
WHAT DO YOU MEAN BY 4-BIT BINARY ADDER?
• A 4-BIT Binary ADDERS IS ARITHMETIC CIRCUITS IN THE FORM OF HALF-
ADDERS USED TO
• ADD, TOGETHER TWO BINARY DIGITS.
APPRATUS
BREADBOARD 2 Dip switches
AND gate (IC# 7408) Jumping wires
XOR gate (IC# 7486 ) Battery
OR gate (IC# 7432) LED’S
WORKING
• THE BASIC ADDING CIRCUIT IS JUST CONSISTS OF A XOR GATE AND AN AND GATE TO GIVE YOU THE BASIC
OUTPUT WITH A CARRY BIT.
• AND GATE TIED IN PARALLEL WITH THE XOR GATE AND IS THE CARRYOUT BIT, SO THAT WHEN YOU ADD 1+1,
YOU CAN GET 10.
• WELL THE PROBLEM IS THAT THERE IS NO CARRYING BIT ON THE SECOND ADDER.
IN ORDER TO MAKE A FULL ADDER, WE HAVE TO USE 2 XOR GATES, 2 AND GATES And AN OR GATE.
THIS GIVES YOU THE BIT OUTPUT.
OUTPUT FROM XOR GATE AND XOR IT WITH THE CARRY-IN. AND SECONDLY ,YOU HAVE TO PUT A AND B THROUGH AN
AND GATE, AND PUT THE OUTPUT OF THE A XOR B GATE AND THE CARRY-IN THROUGH AN AND GATE AS WELL. . WHEN
YOU PUT THOSE 2 OUTPUTS INTO AN OR GATE, YOU GET A CARRY-OUT BIT. SO NOW WE CAN PUT A BUNCH OF THESE
TOGETHER AND GET A CALCULATOR
DIAGRAM/TRUTH
TABLE
Truth Table: Basic Truth Table for a single set of
gates.
EXPECTED OUTCOME
With four bit inputs the solution might
end up in 5-bits due to carry coming
from preceding addition
CONCLUSION
• FROM THIS PROJECT WE DEMONSTRATED USING BASIC LOGICAL
GATES (XOR, AND, OR) THAT HOW A COMPUTER ADD NUMBERS. WITH
THESE KIND OF BASIC OPERATIONS ADDED AND DESIGNED TO
SPECIFIC NEEDS ENDS UP IN HIGHLY COMPLICATED CHIPS USED IN
OUR COMPUTERS I.E. INTEL I7, RYZEN 5 COMPUTING CHIPS.
THANK YOU