ee101_ec1

ee101_ec1 - EE 101 Extra Credit 1 Fall 07 Redekopp Name: _...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
EE 101 Extra Credit 1 Fall ’07 Redekopp Name: _________________________________________ Lecture 9:30 / 12:30 / 2:00 Due: Tues. Nov. 27th in class Score: ________ DO NOT COPY!! Anyone caught copying will receive negative points! We have seen in class that cascading full-adders yields a slow circuit due to the fact that the carry has to ripple (propagate) through each full adder in the chain. One method to fix this problem is called carry-lookahead logic. Use the following listed resources or do some research on your own and answer the following questions for extra credit. Carry-Lookahead Logic Resources Pages 478-479 and 484-487 in the Wakerly textbook (4 th ed.) Online at http://www.tcnj.edu/~gibson2/CL/cla.html other web sites Note: There are 3 pages to this assignment! 1. Consider the 4-bit RCA (RCA = ripple-carry adder = 4 full-adders chained together) shown below with the full adder implementation also shown below. Annotate the 4-bit RCA showing how many gate delays each carry-out and sum bit requires before it can be
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

ee101_ec1 - EE 101 Extra Credit 1 Fall 07 Redekopp Name: _...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online