Fast Radix-10 Multiplication Using Redundant BCD Codes

DOI10.1109/TC.2014.2315626MaRDI QIDQ5268094zbMATH OpenOpenAlexFDO

Authors Álvaro Vázquez, Elisardo Antelo, Javier D. Bruguera

Publication date 20 June 2017

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

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

Mathematics Subject Classification ID

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

Recommendations

• High Performance Parallel Decimal Multipliers Using Hybrid BCD Codes
• High-Speed Parallel Decimal Multiplication with Redundant Internal Encodings
• Efficient ASIC and FPGA implementation of binary-coded decimal digit multipliers
• Fast binary multiplication by performing dot counting and complement recoding
• Area-Efficient Multipliers Based on Multiple-Radix Representations
• A Radix-10 Digit-Recurrence Division Unit: Algorithm and Architecture
• High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
• A Low-Complexity High-Radix RNS Multiplier
• Comment on “High Speed Parallel Decimal Multiplication With Redundant Internal Encodings”

Cited in

(1)

• A radix-10 BKM algorithm for computing transcendentals on pocket computers

This page was built for publication: Fast Radix-10 Multiplication Using Redundant BCD Codes

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