Logic 6

I.
Objectives
To be familiar and be able to create arithmetic and logic circuits To apply the function of logic circuit in arithmetic for combinational and sequential logic circuit
II.
Materials and Equipment Used

And gates Or gates Nand gates inverter LEDs Tact switches Breadboards Wires DC power supply
III.
Procedures
1. Research the following: definition, circuit diagram a) b) c) d) e) f) g) h) Half adder Half adder using nand gates Full adder Full adder using nand gates Half subtractor Half subtractor using nand gates Full subtractor Full subtractor using nand gates
2. Create their respective truth table and Karnaugh map to obtain their circuits. 3. Wire the circuit obtained.
IV.
Breadboard Layout
V.
Table and Results of Karnaugh Mapping

A B 0 0 0 1 1 0 1 1 Half Adder Sum 0 1 1 0 Carry 0 0 0 1 A B C 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 Full Adder Sum 0 1 1 0 1 0 0 1 Carry 0 0 0 1 0 1 1 1
A B 0 0 0 1 1 0 1 1
Half Subtractor Difference Borrow 0 0 1 1 1 0 0 0
A B C 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1
Full Subtractor Difference 0 1 1 0 1 0 0 1
Borrow 0 1 1 1 0 0 0 1
SUM HALF ADDER FULL ADDER : : AB + AB ABC + ABC + ABC + ABC DIFFERENCE HALF SUBTRACTOR FULL SUBTRACTOR : : AB + AB ABC + ABC + ABC + ABC
CARRY AB AB + BC + AC BORROW AB AB + AC + BC
VI.
Data Analysis
The combinational circuits I constructed were the half and full adder and the half and full subtractor. Half adder is a combinational circuit that performs addition of two bits, as addends, while the full adder adds three bit, the two significant bits and a previous carry. On the other hand, half subtractor performs subtraction of two bits, the minuend and the subtrahend, while the full subtractor operates in three inputs, the minuend and subtrahend and a previous borrow. Their outputs are shown on the previous truth tables. Using those truth tables, their resulting circuits are obtained through Karnaugh mapping. Just like the previous experiments and knowing the principles of Karnaugh mapping, I came up with the minimized circuits.
HALF ADDER FULL ADDER HALF SUBTRACTOR FULL SUBTRACTOR
: : : :
SUM AB + AB ABC + ABC + ABC + ABC DIFFERENCE AB + AB ABC + ABC + ABC + ABC
CARRY AB AB + BC + AC BORROW AB AB + AC + BC
VII.
Results and Discussion

In this experiment, we first research about the combinational circuits we are to construct. After knowing how their perform, we created their truth tables and used it to obtain their circuits/equations for us to wire it. On one breadboard, we constructed them first using the XOR gates, OR gates, and AND gates while on another breadboard, we constructed them using NAND gates only. After constructing these combinational circuit, we tested it if we really made it right. And finally, after testing them, we have verified the truth tables through the data we obtained upon testing those circuits.
VIII.
Conclusion
After doing the experiment, I became familiar with the combinational circuits we used here such as the half adder, full adder, half subtractor, and the full subtractor. Aside from familiarizing myself to them, I was able to create and use them for arithmetic operation, addition and subtraction, of two-three bits.
IX.
Research
HALF ADDER & FULL ADDER THEORY: The most basic arithmetic operation is the addition of two binary digits. There are four possible elementary operations, namely, 0+0=0 0+1=1 1+0=1 1 + 1 = 102 The first three operations produce a sum of whose length is one digit, but when the last operation is performed the sum is two digits. The higher significant bit of this result is called a carry and lower significant bit is called the sum. HALF ADDER: A combinational circuit which performs the addition of two bits is called half adder. The input variables designate the augend and the addend bit, whereas the output variables produce the sum and carry bits. FULL ADDER: A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented with two half adders and one OR gate. HALF ADDER TRUTH TABLE: S.No 1. 2. 3. 4. INPUT A 0 0 1 1 OUTPUT S 0 1 1 0
B 0 1 0 1
C 0 0 0 1
CIRCUIT DIAGRAM:
FULL ADDER TRUTH TABLE: S.No 1. 2. 3. 4. 5. 6. 7. 8. INPUT A 0 0 0 0 1 1 1 1 OUTPUT SUM 0 1 1 0 1 0 0 1
B 0 0 1 1 0 0 1 1
C 0 1 0 1 0 1 0 1
CARRY 0 0 0 1 0 1 1 1
DESIGN: From the truth table the expression for sum and carry bits of the output can be obtained as, SUM = ABC + ABC + ABC + ABC CARRY = ABC + ABC + ABC +ABC Using Karnaugh maps the reduced expression for the output bits can be obtained as, SUM
SUM = ABC + ABC + ABC + ABC = A CARRY
CARRY = AB + AC + BC
CIRCUIT DIAGRAM:
HALF SUBTRACTOR & FULL SUBTRACTOR THEORY: The arithmetic operation, subtraction of two binary digits has four possible elementary operations, namely, 0-0=0 0 - 1 = 1 with 1 borrow 1-0=1 1-1=0 In all operations, each subtrahend bit is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the subtrahend bit, hence 1 is borrowed. HALF SUBTRACTOR: A combinational circuit which performs the subtraction of two bits is called half subtractor. The input variables designate the minuend and the subtrahend bit, whereas the output variables produce the difference and borrow bits. FULL SUBTRACTOR: A combinational circuit which performs the subtraction of three input bits is called full subtractor. The three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be implemented with two half subtractors and one OR gate.
HALF SUBTRACTOR TRUTH TABLE: S.No 1. 2. 3. 4. INPUT A 0 0 1 1 OUTPUT DIFF 0 1 1 0
B 0 1 0 1
BORR 0 1 0 0
CIRCUIT DIAGRAM:
FULL SUBTRACTOR TRUTH TABLE:
INPUT S.No A 1. 2. 3. 4. 5. 6. 7. 8. 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1
OUTPUT DIFF 0 1 1 0 1 0 0 1 BORR 0 1 1 1 0 0 0 1
DESIGN: From the truth table the expression for difference and borrow bits of the output can be obtained as, Difference, DIFF= ABC + ABC + ABC + ABC Borrow, BORR = ABC + ABC + ABC +ABC Using Karnaugh maps the reduced expression for the output bits can be obtained as, DIFFERENCE
DIFF = ABC + ABC + ABC + ABC = A BORROW
BORR = AB + AC + BC CIRCUIT DIAGRAM:

Logic 6

Uploaded by

Copyright:

Available Formats

Logic 6

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Logic 6

Uploaded by

Copyright:

Available Formats

I.

Materials and Equipment Used

Table and Results of Karnaugh Mapping

Half Subtractor Difference Borrow 0 0 1 1 1 0 0 0

Full Subtractor Difference 0 1 1 0 1 0 0 1

HALF ADDER FULL ADDER HALF SUBTRACTOR FULL SUBTRACTOR

Results and Discussion

FULL ADDER TRUTH TABLE: S.No 1. 2. 3. 4. 5. 6. 7. 8. INPUT A 0 0 0 0 1 1 1 1 OUTPUT SUM 0 1 1 0 1 0 0 1

SUM = ABC + ABC + ABC + ABC = A CARRY

HALF SUBTRACTOR TRUTH TABLE: S.No 1. 2. 3. 4. INPUT A 0 0 1 1 OUTPUT DIFF 0 1 1 0

FULL SUBTRACTOR TRUTH TABLE:

OUTPUT DIFF 0 1 1 0 1 0 0 1 BORR 0 1 1 1 0 0 0 1

DIFF = ABC + ABC + ABC + ABC = A BORROW

BORR = AB + AC + BC CIRCUIT DIAGRAM:

You might also like