Check out my first novel, midnight's simulacra!

Wallace tree: Difference between revisions

From dankwiki
(Created page with "A circuit which reduces the problem of summing n n-bit numbers to the problem of summing two O(n)-bit numbers, using floor(n/3) parallel carry-save adders. This reduces an n-w...")
 
No edit summary
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
A circuit which reduces the problem of summing n n-bit numbers to the problem of summing two O(n)-bit numbers, using floor(n/3) parallel carry-save adders. This reduces an n-way sum to a ceil(2n/3)-way sum, which can be recursively defined as another reducing Wallace tree.
A circuit which reduces the problem of summing n n-bit numbers to the problem of summing two O(n)-bit numbers, using floor(n/3) parallel carry-save adders. This reduces an n-way sum to a ceil(2n/3)-way sum, which can be recursively defined as another reducing Wallace tree. Usually defined as part of the [[Wallace Multiplier|Wallace tree multiplier]].
[[CATEGORY: Computer Science Eponyms]]

Latest revision as of 02:25, 27 September 2012

A circuit which reduces the problem of summing n n-bit numbers to the problem of summing two O(n)-bit numbers, using floor(n/3) parallel carry-save adders. This reduces an n-way sum to a ceil(2n/3)-way sum, which can be recursively defined as another reducing Wallace tree. Usually defined as part of the Wallace tree multiplier.