FRIHOST FORUMS SEARCH FAQ TOS BLOGS COMPETITIONS
You are invited to Log in or Register a free Frihost Account!


A Question for Electrical and Computer Engineers





NewGuyinTown
Is it safe to say a ripple-carry adder has O(n) and the look-ahead carry adder has O(1)?
Esch
While it's marginally safe to say that a ripple-carry adder has O(n) complexity, I don't think you can say that a carry-lookahead adder has O(1). As you increase n, the number of gates you require increases tremendously (by a factor of O(n^2), actually) as well as (more importantly) the number of inputs to your gates (especially the OR gates), which ends up making them much slower.

I'm not sure what the performance analysis would be off the top of my head, but it's surely more than constant time.
Related topics
coputers jokes ! this jokes dont post here ...
Are you a network engineer?
Computer jokes (funny!)
Silicon: A thing of the PAST?
Predeterminism and Computer Science
Silicon: A Thing Of The Past ?, DNA a possible substitute...
[Official]Wii
Program For Ports?
Materials Engineering
should we care about antartic ice melting?
Computer or Mechanical Engineer?
How many Operating System exist in this world?
Fractal?
electrical engineers income per month rate in america?
Reply to topic    Frihost Forum Index -> Scripting -> Others

FRIHOST HOME | FAQ | TOS | ABOUT US | CONTACT US | SITE MAP
© 2005-2011 Frihost, forums powered by phpBB.