Analysis of different architectures of counter based Wallace multipliers

Multiplication is one of the most commonly used operations in the signal processing algorithms. Multipliers based on Wallace reduction tree provide an area-efficient strategy for high speed multiplication. A number of modifications are proposed in the literature to optimize the speed and area of the Wallace multiplier. Counter based Wallace multipliers are proved to provide faster operation as compared to the traditional Wallace multipliers. This work proposes a number of architectures for the counter based Wallace multipliers to analyse their performance for various bit lengths. Designs are synthesized using Synopsys Design Compiler in 90 nm process technology and the post synthesis delay and power results are obtained by using Synopsys Prime Time. The proposed counter based Wallace multipliers are also compared with traditional Wallace multiplier to evaluate the energy per operation of both designs. The synthesis results shows that the Power-Delay Product of the counter based Wallace multiplier is up to 17% lower as compared to the traditional Wallace multiplier.

[1]  Jalil Fadavi-Ardekani,et al.  M*N Booth encoded multiplier generator using optimized Wallace trees , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[2]  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.

[3]  C. Vinoth,et al.  A novel low power and high speed Wallace tree multiplier for RISC processor , 2011, 2011 3rd International Conference on Electronics Computer Technology.

[4]  Mary Sheeran,et al.  Multiplier reduction tree with logarithmic logic depth and regular connectivity , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[5]  Earl E. Swartzlander Parallel Counters , 1973, IEEE Transactions on Computers.

[6]  Yinan Kong,et al.  Performance analysis of Wallace and radix-4 Booth-Wallace multipliers , 2015, 2015 Electronic System Level Synthesis Conference (ESLsyn).

[7]  Earl E. Swartzlander,et al.  A Reduced Complexity Wallace Multiplier Reduction , 2010, IEEE Transactions on Computers.

[8]  Caxton C. Foster,et al.  Counting Responders in an Associative Memory , 1971, IEEE Transactions on Computers.

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

[10]  M. Mehta,et al.  High-speed multiplier design using multi-input counter and compressor circuits , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[11]  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).