High Speed Speculative Multipliers Based on Speculative Carry-Save Tree

This paper proposes a novel approach to build integer multiplication circuits based on speculation, a technique which performs a faster-but occasionally wrong-operation resorting to a multi-cycle error correction circuit only in the rare case of error. The proposed speculative multiplier uses a novel speculative carry-save reduction tree using three steps: partial products recoding, partial products partitioning, speculative compression. The speculative tree uses speculative (m:2) counters, with m > 3, that are faster than a conventional tree using full-adders and half-adders. A technique to automatically choose the suitable speculative counters, taking into accounts both error probability and delay, is also presented in the paper. The speculative tree is completed with a fast speculative carry-propagate adder and an error correction circuit. We have synthesized speculative multipliers for several operand lengths using the UMC 65 nm library. Comparisons with conventional multipliers show that speculation is effective when high speed is required. Speculative multipliers allow reaching a higher speed compared with conventional counterparts and are also quite effective in terms of power dissipation, when a high speed operation is required.

[1]  Román Hermida,et al.  Multispeculative Addition Applied to Datapath Synthesis , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Paolo Ienne,et al.  Improving XOR-Dominated Circuits by Exploiting Dependencies between Operands , 2007, 2007 Asia and South Pacific Design Automation Conference.

[3]  Shen-Fu Hsiao,et al.  Design of high-speed low-power 3-2 counter and 4-2 compressor for fast multipliers , 1998 .

[4]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[5]  Davide De Caro,et al.  Fixed-Width Multipliers and Multipliers-Accumulators With Min-Max Approximation Error , 2013, IEEE Transactions on Circuits and Systems I: Regular Papers.

[6]  Taewhan Kim,et al.  An Optimal Allocation of Carry-Save-Adders in Arithmetic Circuits , 2001, IEEE Trans. Computers.

[7]  Kaushik Roy,et al.  Voltage Scalable High-Speed Robust Hybrid Arithmetic Units Using Adaptive Clocking , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Chip-Hong Chang,et al.  Ultra low-voltage low-power CMOS 4-2 and 5-2 compressors for fast arithmetic circuits , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[9]  Davide De Caro,et al.  Design of Fixed-Width Multipliers With Linear Compensation Function , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[10]  Vojin G. Oklobdzija,et al.  A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach , 1996, IEEE Trans. Computers.

[11]  R. Ravi,et al.  Optimal Circuits for Parallel Multipliers , 1998, IEEE Trans. Computers.

[12]  Román Hermida,et al.  Multispeculative additive trees in High-Level Synthesis , 2013, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[13]  Tong Liu,et al.  Performance improvement with circuit-level speculation , 2000, Proceedings 33rd Annual IEEE/ACM International Symposium on Microarchitecture. MICRO-33 2000.

[14]  Davide De Caro,et al.  Dual-tree error compensation for high performance fixed-width multipliers , 2005, IEEE Transactions on Circuits and Systems II: Express Briefs.

[15]  G. De Micheli,et al.  Circuit and architecture trade-offs for high-speed multiplication , 1991 .

[16]  Lingamneni Avinash,et al.  Novel Architectures for High-Speed and Low-Power 3-2, 4-2 and 5-2 Compressors , 2007, 20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07).

[17]  Alessandro Cilardo A new speculative addition architecture suitable for two's complement operations , 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

[18]  Davide De Caro,et al.  Truncated Binary Multipliers With Variable Correction and Minimum Mean Square Error , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.

[19]  Peter J. Varman,et al.  High performance reliable variable latency carry select addition , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[20]  Román Hermida,et al.  A Distributed Controller for Managing Speculative Functional Units in High Level Synthesis , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[21]  Paolo Ienne,et al.  Variable Latency Speculative Addition: A New Paradigm for Arithmetic Circuit Design , 2008, 2008 Design, Automation and Test in Europe.

[22]  Shih-Lien Lu Speeding Up Processing with Approximation Circuits , 2004, Computer.

[23]  K.K. Parhi,et al.  Low-power 4-2 and 5-2 compressors , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).