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 difference)
|
Revision as of 00:55, 26 March 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.
