The Gateway to Computer Science Excellence
0 votes
257 views
32-bit [ripple carry] adder, there are 32 full adders, so the critical path (worst case) delay is 31 * 2(for carry propagation) + 3(for sum) = 65 gate delays. how ?

note :I know in full adder there are two XOR two AND and 1 OR gate
well know about diagram
in Digital Logic by Active (1.8k points) | 257 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,475 answers
195,395 comments
100,379 users