Fixed-Width Multi-Level Recursive Multipliers

This paper presents analysis of new truncation techniques targeting fixed-width digital multipliers based on a multi-level recursive architecture. Error analysis shows that the maximal error is bounded by 1.25 for two-level and 0.25(2^k + 1) for A-level fixed-width recursive multipliers. Complexity savings are also shown to be approximately 37.5% for two-level and multipliers. 50(1 - 2^k) percent for A-level recursive multipliers.