Truncation Schemes for Recursive Multipliers

Abstract

This paper explores the effects of truncation schemes in recursive multiplier architectures in terms of the trade-off between circuit complexity versus introduced truncation errors. The recursive architecture is examined due to its inherent hierarchical structure whereby a larger multiplication is subdivided into a collection of smaller multiplications. Three data-dependent truncation schemes are proposed that exploit this multiplication architecture. Error analysis and complexity savings for each scheme are also discussed.

Truncation Scheme for Recursive Multipliers

“…The first proposal for truncation scheme for recursive multiplier was proposed in 2005 [1] and since then only one paper has been proposed in 2006 [2]. The results proposed are good but can still be further improved.…”