EE207: Digital Systems I, Semester I 2003/2004

CHAPTER 3-iv: Combinational Logic Design (Section 3.8)

Overview Binary Addition

Half Adder Full Adder Ripple Carry Adder Carry Lookahead Adder

Decimal Addition (Section 3.12)

BCD Adder

9-Apr-10

Chapter 3-iv: Combinational Logic Design (3.8)

1-bit Adder

Performs the addition of two binary bits. Four possible operations:

0+0=0 0+1=1 1+0=1 1+1=10

Circuit implementation requires 2 outputs; one to indicate the sum and another to indicate the carry.
9-Apr-10
Chapter 3-iv: Combinational Logic Design (3.8) 3

Half Adder
Performs 1-bit addition. Inputs: A0, B0 Outputs: S0, C1 Index indicates significance, 0 is for LSB and 1 is for the next higher significant bit. Boolean equations:
S0 = A0B0+A0B0 = A0 B0 C1 = A0B0
9-Apr-10
Chapter 3-iv: Combinational Logic Design (3.8) 4

A0 B0 S0 C1 0 0 1 1 0 1 0 1 0 1 1 1 0 0 0 1

Truth Table

Half Adder (cont.)

S0 = A0B0+A0B0 = A0 B0 C1 = A0B0
Block Diagram
A0 C1 B0 A0 B0 S0

Logic Diagram

1 bit half adder S0

C1

9-Apr-10

Chapter 3-iv: Combinational Logic Design (3.8)

n-bit Addition
Design an n-bit binary adder which performs the addition of two n-bit binary numbers and generates a n-bit sum and a carry out. Example: Let n=4
Cout C3 C2 C1 C0 1 1 0 1 0 A3 A2 A1 A0 1 1 0 1 +B3 B2 B1 B0 +1 1 0 1 ----------------------S3 S2 S1 S0 1 0 1 0

This requires 3-bit addition!

9-Apr-10
Chapter 3-iv: Combinational Logic Design (3.8) 6

Full Adder Full adder (for higher-order bit addition) Combinational circuit that performs the additions of 3 bits (two bits and a carry-in bit)
Ai Bi Ci+1 1 bit full adder Si
9-Apr-10
Chapter 3-iv: Combinational Logic Design (3.8) 7

Ci

Full Adder (cont.)

The K-maps for Ci+1:

Ai

BiCi

Ai 0 0 0 0 1 1 1 1

Bi 0 0 1 1 0 0 1 1

Ci 0 1 0 1 0 1 0 1

Si 0 1 1 0 1 0 0 1

Ci+1 0 0 0 1 0 1 1 1

0 0 1 0 0 1 1 1

Si:
Ai BiCi

0 1 0 1 1 0 1 0

9-Apr-10

Chapter 3-iv: Combinational Logic Design (3.8)

Full Adder (cont.)

nBoolean n

equations:

Ci+1 = AiBi + AiCi + BiCi n Si = AiBi Ci + AiBiCi + AiBiCi + AiBiCi = Ai Bi Ci

can design full adder circuit directly from the above equations (requires 3 ANDs and 1 OR for Ci+1 and 2 XORs for Si) nCan we do better?
9-Apr-10
Chapter 3-iv: Combinational Logic Design (3.8) 9

nYou

Full Adder using 2 Half Adders

A full adder can also be realized with two half adders and an OR gate, since Ci+1 can also be expressed as: Ci+1 = AiBi + AiBiCi + AiBiCi = AiBi + (AiBi + AiBi)Ci = AiBi + (Ai Bi)Ci and Si = Ai Bi Ci
Ai Bi Si

Ci+1 Ci 9-Apr-10
Chapter 3-iv: Combinational Logic Design (3.8) 10

n-bit Combinational Adders Perform parallel multi-bit addition Ripple Carry Adder
Simple design Time consuming. Why? (youll see in a bit!)

Carry Lookahead Adder

More complex than ripple-carry adder Reduces circuit delay

9-Apr-10

Chapter 3-iv: Combinational Logic Design (3.8)

11

n-bit Ripple Carry Adder

Constructed using n 1-bit full adder blocks in parallel. Cascade the full adders so that the carry out from one becomes the carry in to the next higher bit position.

9-Apr-10

Chapter 3-iv: Combinational Logic Design (3.8)

12

Example: 4-bit Ripple Carry Adder

C4 C3 C2 C1 C0 A3 A2 A1 A0 +B3 B2 B1 B0 -------------S3 S2 S1 S0

9-Apr-10

Chapter 3-iv: Combinational Logic Design (3.8)

13

Ripple Carry Adder Delay

Circuit delay in an n-bit ripple carry adder is determined by the delay on the carry path from the LSB (C0) to the MSB (Cn). Let the delay in a 1-bit FA be . Then, the delay of an n-bit ripple carry adder is n.

9-Apr-10

Chapter 3-iv: Combinational Logic Design (3.8)

14

Carry Lookahead Adder

Alternative design for a combinational n-bit adder. Practical design with reduced delay at the expense of more complex hardware. See Wakerly 5.10.4

9-Apr-10

Chapter 3-iv: Combinational Logic Design (3.8)

15