Walks through determining the latency (both critical path and shortest path) and area of a 30-bit carry lookahead adder with k=3-bit blocks.
Жүктеу.....
Пікірлер: 5
@user-xq4fu7wr6e Жыл бұрын
thank you for your effort
@xyz78004 жыл бұрын
awesome!!!
@efekaanfidanc1620 Жыл бұрын
thanks a lot man
@TheSubsonicOne4 ай бұрын
this seems longer in terms of prop delay than just using ripple carry?
@matthewwatkins88
4 ай бұрын
Can you explain how you arrived at that statement? This figure has 30 gates. A standard ripple carry would take 30 stages. The figure in this video has 10+3 (=13) stages for the max delay.
Пікірлер: 5
thank you for your effort
awesome!!!
thanks a lot man
this seems longer in terms of prop delay than just using ripple carry?
@matthewwatkins88
4 ай бұрын
Can you explain how you arrived at that statement? This figure has 30 gates. A standard ripple carry would take 30 stages. The figure in this video has 10+3 (=13) stages for the max delay.