Fast conversion techniques for binary-residue number systems

DOI10.1109/81.340862MaRDI QIDQ4338125zbMATH OpenOpenAlexFDO

Authors Bapiraju Vinnakota, V. V. Bapeswara Rao

Publication date 18 August 1997

Published in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

binary-residue number systemsChinese remainder theoremfast conversion

Mathematics Subject Classification ID

Values of arithmetic functions; tables (11Y70) Computation of special functions and constants, construction of tables (65D20)

Recommendations

• An efficient residue to binary converter design
• An improved residue-to-binary converter
• A new efficient memoryless residue to binary converter
• Comments on ``The digit parallel method for fast RNS to weighted number system conversion for specific moduli \((2^k -1, 2^k, 2^k +1)\)

Cited in

(12)

• Mod \(m\) arithmetic in binary systems
• A fully parallel algorithm for residue to binary conversion
• RNS sign detector based on Chinese remainder theorem II (CRT II)
• Comments on ``The digit parallel method for fast RNS to weighted number system conversion for specific moduli \((2^k -1, 2^k, 2^k +1)\)
• On the optimal utilization of all available states in the \(2^{n}\) moduli set
• scientific article; zbMATH DE number 3861071 (Why is no real title available?)
• scientific article; zbMATH DE number 5360581 (Why is no real title available?)
• Some new results in numerical systems
• A new efficient memoryless residue to binary converter
• Fast base extension using a redundant modulus in RNS
• Design methods for binary to decimal converters using arithmetic decompositions
• On Translation Algorithms in Residue Number Systems

This page was built for publication: Fast conversion techniques for binary-residue number systems

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