part 2: design circuit. logic circuit design x y z f 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1...

12
LOGIC CIRCUIT Part 2: DESIGN CIRCUIT

Upload: augusta-hubbard

Post on 23-Dec-2015

224 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

LOGIC CIRCUITPart 2: DESIGN CIRCUIT

Page 2: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

LOGIC CIRCUIT DESIGNx y z F0 0 0 00 0 1 10 1 0 00 1 1 01 0 0 11 0 1 11 1 0 11 1 1 1

F = x + y’z

x

y

z

F

TruthTable

BooleanFunction

LogicDiagram

Page 3: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

Design Logic Circuit using NAND gates onlyE.g. 1: A + B’

Page 4: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

Design Logic Circuit using NAND gates only

E.g. 2: A’B + C

Page 5: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

Design Logic Circuit using NAND gates only

E.g. 3: [(A + B) . C]’’

Page 6: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

Half Adder circuit

To understand what is a half adder you need to know what is an adder first.

Adder circuit is a combinational digital circuit that is used for adding two numbers. A typical adder circuit produces a sum bit (denoted by S) and a carry bit (denoted by C) as the output.

Besides addition, adder circuits can be used for a lot of other applications in digital electronics like address decoding, table index calculation etc.

Adder circuits are of two types: Half adder and Full adder.

Page 7: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

Half Adder circuit

Half adder is a combinational arithmetic circuit that adds two numbers and produces a sum bit (S) and carry bit (C) as the output.

The arithmetic operation, addition of two binary digits has four possible elementary operations, namely:

0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 with 1 carry

If  A and B are the input bits, then sum bit (S) is the X-OR of A and B and the carry bit (C) will be the AND of A and B.

From this it is clear that a half adder circuit can be easily constructed using one X-OR gate and one AND gate.

Page 8: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

Half Adder circuit

Inputs: A + BOutputs: Sum (S) , Carry (C)

Truth Table

Logic Circuit

Boolean Expressions:

Sum (S) = A’B + AB’

Carry (C) = AB

Page 9: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

Half Subtractor circuit

Half Subtractor is a combinational circuit that performs subtraction of two bits and has two inputs and two outputs.

The two inputs denoted by A and B represents minuend and subtrahend. The two outputs are the difference “D” and the borrow bit “Bo“.

Page 10: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

Half Subtractor circuit

Half Subtractor is a combinational circuit that performs subtraction of two bits and has two inputs and two outputs.

The two inputs denoted by A and B represents minuend and subtrahend. The two outputs are the difference “D” and the borrow bit “Bo“.

Truth Table

Boolean Expressions:

Difference (D) = A’B + AB’

Borrow (B0) = A’B

Logic Circuit

Page 11: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

Multiplexer

A multiplexer has many input lines and one output line. The signal from one input line will be directed to the output line. The input line is chosen based on the signals which are carried to the

multiplexer on another set of input lines called control lines. Multiplexers are sometimes called selectors because they choose or

select one of their inputs.The number of control lines needed depends on the number of input

lines. A multiplexer with 2 control lines can select from 4 input lines, a

multiplexer with 3 control lines can select from 8 input lines. In general, a multiplexer with n control lines can select from up to

2ninput lines.

Page 12: Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function

Multiplexers

4-to-1 multiplexer