Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Chapter 4

# Chapter 4

Ratings: (0)|Views: 2,104|Likes:

### Availability:

See more
See less

11/27/2012

pdf

text

original

BENM 1143 (LOGIC CIRCUITS)
CHAPTER 44Types Of Combinational Logic Circuits
Arithmetic circuits are the one, which perform arithmetic operations like addition,subtraction, multiplication, division, and parity calculation. Most of the time, designingthese circuits is same as designing mux, encoders and decoders.
Adders are the basic buliding blocks of all the arthmetic circuits, adders add two binarynumbers and give out sum and carry as output. Basically we have two types of adders.
Adding two single-bit binary values, X, Y produces a sum S bit and a carry out C-out bit.This operation is called half addition and the circuit to realize it is called a half adder.Table 9.3:Truth Table of the half adder
XYSUMCARRY0000011010101101
S (X,Y) =
(1,2)S = X’Y + XY’S = X

YCARRY (X,Y) =
(3)CARRY = XY1

BENM 1143 (LOGIC CIRCUITS)
Figure 4.1: Symbol of the half adder Figure 4.2: Circuit of the half adder
Full adder takes three bit input. Adding two single-bit binary values, X, Y with a carry input bit C-in produces a sum bit S and a carry out C-out bit.Table 4.1: Truth Table of the full adder XYZSUMCARRY0000000110010100110110010101011100111111
Boolean Algebra:
SUM (X,Y,Z) = (1,2,4,7) CARRY (X,Y,Z) =
Σ
(3,5,6,7)SUM =
Σ
X Y Z2

BENM 1143 (LOGIC CIRCUITS)
SUM = X'Y'Z + XY'Z' + X'YZ'CARRY = XY
XZ
YZFigure 4.3: Symbol of the full adder
Below implementation show implementing the full adder which AND-OR gates, instead of using XOR gates.Figure 4.4: Sum circuit of the full adder using AND-OR gatesFigure 4.5: Carry circuit of the full adder using AND-OR gates
4.2Encoders
3