Wallace tree

From dankwiki
Revision as of 02:25, 27 September 2012 by Dank (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.