Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem

DOI10.1080/00207160.2016.1247439OpenAlexW2529865900MaRDI QIDQ3174867

P. A. Lyakhov, N. I. Chervyakov, M. A. Deryabin, M. G. Babenko, Amir Sabbagh Molahosseini

Publication date: 18 July 2018

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2016.1247439

zbMATH Keywords

Chinese remainder theoremcomputer arithmeticresidue arithmeticresidue number systemsresidue-to-binary converter

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for specific classes of architectures (65Y10) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (5)

CRTf-Based Reverse Converter for RNS with Low-Cost Modules $$\{{2}^{n},{2}^{n}-1,{2}^{n+1}-1\}$$ ⋮ Reference Points Based RNS Reverse Conversion for General Moduli Sets ⋮ Positional characteristics for efficient number comparison over the homomorphic encryption ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ Application of the residue number system to reduce hardware costs of the convolutional neural network implementation

Cites Work

• Unnamed Item
• Unnamed Item
• An approximate method for comparing modular numbers and its application to the division of numbers in residue number systems
• An approximate sign detection method for residue numbers and its application to RNS division
• A new high dynamic range moduli set with efficient reverse converter
• Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
• A Residue-to-Binary Converter for a New Five-Moduli Set
• RNS Reverse Converters for Moduli Sets With Dynamic Ranges up to $(8n+1)$-bit
• A New RNS based DA Approach for Inner Product Computation
• A New Approach to the Design of Efficient Residue Generators for Arbitrary Moduli
• Radix-8 Booth Encoded Modulo $2 ^{n} -1$ Multipliers With Adaptive Delay for High Dynamic Range Residue Number System
• Efficient Reverse Converter Designs for the New 4-Moduli Sets <formula formulatype="inline"><tex Notation="TeX">$\{2^{n} -1, 2^{n}, 2^{n} +1, 2^{2n + 1}-1\}$</tex></formula> and <formula formulatype="inline"> <tex Notation="TeX">$\{2^{n} -1, 2^{n} +1, 2^{2n}, 2^{2n} +1\}$</tex></formula> Based on New CRTs

This page was built for publication: Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem