1 / 28

# Computing Machinery Chapter 3: Combinational Circuits - PowerPoint PPT Presentation

Computing Machinery Chapter 3: Combinational Circuits. Half Adder. Full Adder. Full Adder Circuit. s = a b c in. +. +. Simplifying the Full Adder Circuit. C out = ab + ac in + bc in. N-Bit Adder. Ripple-Carry Adder. Carry Look-Ahead Adder (CLA). c in. a i. b i. g i = a i b i

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

## PowerPoint Slideshow about ' Computing Machinery Chapter 3: Combinational Circuits' - erica

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

Chapter 3: Combinational Circuits

s = a b cin.

+

+

Simplifying the Full Adder Circuit

Cout = ab + acin + bcin

cin

ai

bi

gi = aibi

pi = ai + bi

ci+1 = gi + pici

1. Will ith FA generate a carry bit?

2. Will ith FA propagate a carry bit?

3. What is the carry-out for the ith FA?

ith FA

ci+1

si

Function Table

(aka 1-of-8)

F(x,y,z) = m( 1, 2, 5, 7 )

G(x,y,z) = m( 1, 4, 5, 6 )