Professional Documents
Culture Documents
DLD Set 2
DLD Set 2
DLD Set 2
Objectives
Designing a half adder involves creating a circuit that accurately adds two single-bit binary
numbers, producing the correct sum and carry outputs for all input combinations. Optimization is
essential, aiming for minimal gate usage and compatibility with other circuits. Attention to
logical correctness, low propagation delay, and thorough documentation ensures the half-adder
functions efficiently within broader digital systems.
Materials
Breadboard
Logic gates (AND, XOR, OR)
Connecting wires and jumper cables
Power supply
Switches
LEDs
Procedure
1. A half adder circuit consists of two input terminals namely A and B.
2. Both of these add two input digits (one-bit numbers) and generate the output in the form
of a carry and a sum.
3. Thus, there are two output terminals. The output that one obtains from the EX-OR gate is
the sum of both the one-bit numbers.
Truth table
Snapshot of the circuit
Conclusion
In summary, test the half adder for input combinations, check outputs against the truth table, and
assess timing, robustness, and power supply variation using tools like logic probes. Consistent
results indicate a reliable half-adder for binary addition in digital systems.
Materials
Breadboard
Logic gates (AND, XOR)
Connecting wires and jumper cables
Power supply
Switches
LEDs
Procedure
1. Implement full adder using half adder. A full adder is an adder that adds three inputs and
produces two outputs.
2. The first two inputs are A and B and the third input is an input carry as C-IN.
3. The output carry is designated as C-OUT and the normal output is designated as S which
is SUM.
Truth table
Conclusion
A full adder is a combinational circuit that forms the arithmetic sum of input; it consists of three
inputs and two outputs. A full adder is useful to add three bits at a time but a half adder cannot do
so.
Materials
Breadboard
Logic gates (AND, XOR, NOT)
Connecting wires and jumper cables
Power supply
Switches
LEDs
Truth table
Procedure
1. ‘A’ and ‘B’ are the input variables whose values are going to be subtracted.
2. The ‘Diff’ and ‘Borrow’ are the variables whose values define the subtraction result, i.e.,
difference and borrow.
3. The first two rows and the last row, the difference is 1, but the ‘Borrow’ variable is 0.
4. The third row is different from the remaining one. When we subtract the bit 1 from the bit
0, the borrow bit is produced.
Conclusion
The half subtractor circuit is a key component of digital circuits that illustrates bit manipulation
operations on binary numbers.
Experiment Name: Implementation of Full Subtractor
Objectives
The objectives of a full subtractor circuit include accurately performing binary subtraction,
generating a correct borrow output, ensuring efficiency in terms of speed and power
consumption, and maintaining reliability across various input conditions for seamless integration
into digital systems.
Materials
Breadboard
Logic gates (AND, XOR, NOT, OR)
Connecting wires and jumper cables
Power supply
Switches
LEDs
Procedure
1. Receive three inputs - minuend (A), subtrahend (B), and borrow in (Bin).
2. Compute the difference (D) between A and B, considering the borrow input (Bin) from the
previous stage.
3. Determine the borrow output (Bout) based on the values of A, B, and Bin.
4. Output the computed difference (D) and the borrow output (Bout).
Truth table
Snapshot of the circuit
Conclusion
a full-subtractor is a combinational logic circuit that can compute the difference of three binary
digits