Area-Efficient Multipliers Based on Multiple-Radix Representations

DOI10.1109/TC.2010.200MaRDI QIDQ5280628zbMATH OpenOpenAlexFDO

Authors Kimmo Järvinen, Jithra Adikari, Vassil S. Dimitrov

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2010.200

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Recommendations

• Method for designing efficient mixed radix multipliers
• scientific article; zbMATH DE number 1878333
• Area—Time optimal VLSI integer multiplier with minimum computation time
• scientific article; zbMATH DE number 3887073
• A Low-Complexity High-Radix RNS Multiplier
• Area Efficient and Fast Combined Binary/Decimal Floating Point Fused Multiply Add Unit
• Efficient ASIC and FPGA implementation of binary-coded decimal digit multipliers
• Design and Analysis of Area and Power Efficient Approximate Booth Multipliers
• A design of fast pipelined modular multiplier based on a diminished-radix algorithm

Cited in

(6)

• Circuit level realization of low latency radix-4 Booth scheme for parallel multipliers
• Area—Time optimal VLSI integer multiplier with minimum computation time
• scientific article; zbMATH DE number 1950621 (Why is no real title available?)
• A Low-Complexity High-Radix RNS Multiplier
• Fast Radix-10 Multiplication Using Redundant BCD Codes
• Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers

This page was built for publication: Area-Efficient Multipliers Based on Multiple-Radix Representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280628)