Carry-lookahead adder: Difference between revisions
Jump to navigation
Jump to search
en>Dicklyon |
en>Brainwave64 m →Implementation details: Removed a couple of redundant lines. |
||
| 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>. | |||
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 23:40, 10 January 2014
In electronics, an 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 .
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
Template:No footnotes 43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.