Carry-lookahead adder: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
← Older editNewer edit →
en>Brainwave64
m →‎Implementation details: Removed a couple of redundant lines.
en>Dicklyon
m Reverted 1 edit by 117.231.61.95 (talk) to last revision by Brainwave64. (TW)
Line 1: Line 1:
In electronics, an [[adder (electronics)|adder]] is a combinatorial or sequential logic element which computes the (n+1)-bit sum of two n-bit numbers. The '''Brent–Kung adder''' is one of the most advanced designs, having a gate level depth of <math>O(log_2(n))</math>.
Nice to satisfy you, I am Marvella Shryock. It's not a typical factor but what she likes performing is base jumping and now she is attempting to earn cash with it. Years ago he moved to North Dakota and his family members loves it. Hiring is her day occupation now and she will not alter it whenever soon.<br><br>my web page: [http://dateplate.com/dayzfe at home std testing]
 
The Brent–Kung adder is a parallel prefix form [[carry look-ahead adder]]. It takes less area to implement than the [[Kogge-Stone adder]] and has less wiring congestion, but lower performance.
 
==References==
 
{{no footnotes|date=October 2011}}
{{reflist}}
 
== External links ==
* [http://www.acsel-lab.com/Projects/fast_adder/adder_designs.htm Adder Designs]
* [http://www.openhdl.com/vhdl/653-vhdl-component-brent-kung-adder-generic.html Generic VHDL Implementation of the Brent-Kung Adder]
 
{{DEFAULTSORT:Brent-Kung adder}}
[[Category:Adders]]
 
 
{{Compu-hardware-stub}}

Revision as of 10:37, 7 February 2014

Nice to satisfy you, I am Marvella Shryock. It's not a typical factor but what she likes performing is base jumping and now she is attempting to earn cash with it. Years ago he moved to North Dakota and his family members loves it. Hiring is her day occupation now and she will not alter it whenever soon.

my web page: at home std testing

Retrieved from "https://en.formulasearchengine.com/index.php?title=Carry-lookahead_adder&oldid=243319"