An 8.8-ns 54×54-bit multiplier with high speed redundant binary architecture
Authors:
- H. MakinoHMH. Makino
- Y. NakaseYNY. Nakase
- H. SuzukiHSH. Suzuki
- H. MorinakaHMH. Morinaka
- H. ShinoharaHSH. Shinohara
- K. MashikoKMK. Mashiko
- 1 June 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 31 (6) , 773-783
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A 54*54-b regularly structured tree multiplierIEEE Journal of Solid-State Circuits, 1992
- A fast VLSI adder architectureIEEE Journal of Solid-State Circuits, 1992
- An efficient redundant-binary number to binary number converterIEEE Journal of Solid-State Circuits, 1992
- A 10 ns 54*54 b parallel structured full array multiplier with 0.5 mu m CMOS technologyIEEE Journal of Solid-State Circuits, 1991
- Conversion from signed-digit to radix complement representationInternational Journal of Electronics, 1990
- A 33 Mflops Floating Point Processor Using Redundant Binary Representation1988
- Design of high speed MOS multiplier and divider using redundant binary representation1987
- A high-speed multiplier using a redundant binary adder treeIEEE Journal of Solid-State Circuits, 1987
- Logical design of a redundant binary adder1978
- A SIGNED BINARY MULTIPLICATION TECHNIQUEQuarterly Journal of Mechanics and Applied Mathematics, 1951