A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach
- 1 March 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 45 (3) , 294-306
- https://doi.org/10.1109/12.485568
Abstract
This paper presents a method and an algorithm for generation of a parallel multiplier, which is optimized for speed. This method is applicable to any multiplier size and adaptable to any technology for which speed parameters are known. Most importantly, it is easy to incorporate this method in silicon compilation or logic synthesis tools. The parallel multiplier produced by the proposed method outperforms other schemes used for comparison in our experiment. It uses the minimal number of cells in the partial product reduction tree. These findings are tested on design examples simulated in 1 /spl mu/ CMOS ASIC technology.Keywords
This publication has 25 references indexed in Scilit:
- Multiplier design utilizing improved column compression tree and optimized final adder in CMOS technologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An ASIC macro cell multiplier for complex numbersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A simple, high-precision, high speed digital frequency multiplierPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- M*N Booth encoded multiplier generator using optimized Wallace treesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1993
- A 10 ns 54*54 b parallel structured full array multiplier with 0.5 mu m CMOS technologyIEEE Journal of Solid-State Circuits, 1991
- Circuit and architecture trade-offs for high-speed multiplicationIEEE Journal of Solid-State Circuits, 1991
- A 15-ns 32*32-b CMOS multiplier with an improved parallel structureIEEE Journal of Solid-State Circuits, 1990
- A 40-ns 17-Bit by 17-Bit Array MultiplierIEEE Transactions on Computers, 1971
- High-Speed Arithmetic in Binary ComputersProceedings of the IRE, 1961
- A SIGNED BINARY MULTIPLICATION TECHNIQUEThe Quarterly Journal of Mechanics and Applied Mathematics, 1951