A Simple High-Speed Multiplier Design
- 28 August 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 55 (10), 1253-1258
- https://doi.org/10.1109/tc.2006.156
Abstract
The performance of multiplication is crucial for multimedia applications such as 3D graphics and signal processing systems, which depend on the execution of large numbers of multiplications. Previously reported algorithms mainly focused on rapidly reducing the partial products rows down to final sums and carries used for the final accumulation. These techniques mostly rely on circuit optimization and minimization of the critical paths. In this paper, an algorithm to achieve fast multiplication in two's complement representation is presented. Rather than focusing on reducing the partial products rows down to final sums and carries, our approach strives to generate fewer partial products rows. In turn, this influences the speed of the multiplication, even before applying partial products reduction techniques. Fewer partial products rows are produced, thereby lowering the overall operation time. In addition to the speed improvement, our algorithm results in a true diamond-shape for the partial product tree, which is more efficient in terms of implementation. The synthesis results of our multiplication algorithm using the Artisan TSMC 0.13mum 1.2-volt standard-cell library show 13 percent improvement in speed and 14 percent improvement in power savings for 8-bit times 8-bit multiplications (10 percent and 3 percent, respectively, for 16-bit times 16-bit multiplications) when compared to conventional multiplication algorithmsThis publication has 16 references indexed in Scilit:
- High-performance left-to-right array multiplier designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- A fast and well-structured multiplierPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Analysis of Booth encoding efficiency in parallel multipliers using compressors for reduction of partial productsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Measuring the performance of multimedia instruction setsIEEE Transactions on Computers, 2002
- General data-path organization of a MAC unit for VLSI implementation of DSP processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A 600-MHz 54×54-bit multiplier with rectangular-styled Wallace treeIEEE Journal of Solid-State Circuits, 2001
- High-speed Booth encoded parallel multiplier designIEEE Transactions on Computers, 2000
- A fast parallel multiplier-accumulator using the modified Booth algorithmIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 2000
- Optimal circuits for parallel multipliersIEEE Transactions on Computers, 1998
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964