4.14. Assume that the exclusive-OR gate has a propagation delay of 10 ns and that the AND or OR gates have a propagation delay of 5 ns. What is the total propagation delay time in the four-bit adder with carry lookahead of figure below? (Note: the carry lookahead circuit is implemented as explained in the lecture)
Added by Bryan B.
Close
Step 1
The input carry $C_0$ is generated by an XOR gate, so its propagation delay is 10 ns. Show more…
Show all steps
Your feedback will help us improve your experience
Madhur L and 71 other Physics 102 Electricity and Magnetism educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Consider two 4-bit signed numbers X = X3X2X1X0 and Y = Y3Y2Y1Y0. Using only the minimum number of full adders and NOT gates, design a circuit to perform the following operation: 2X - 5Y. Draw the circuit! Consider that for a full adder, it takes 1.7 ns to generate the sum bit and 2.1 ns to generate the carry bit, and the time delay for the NOT gate is 0.5 ns. After how much time will the result be valid? Ignore the final carry out time delay in your calculations.
Adi S.
Determine the propagation delay and contamination delay of the circuit, assuming gate delays are given in the table below (and only the gates in that table are available): Gate tpd (ps) tcd (ps) NOT 15 10 2-input NAND 20 15 3-input NAND 30 25 2-input NOR 30 25 3-input NOR 45 35 2-input AND 30 25 3-input AND 40 30 2-input OR 40 30 3-input OR 55 45 2-input XOR 60 40 4-input OR/AND 50 45
Sri K.
Recommended Textbooks
University Physics with Modern Physics
Physics: Principles with Applications
Fundamentals of Physics
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD