Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
DOI10.1080/00207160.2016.1247439OpenAlexW2529865900MaRDI QIDQ3174867FDOQ3174867
Authors: N. I. Chervyakov, Amir Sabbagh Molahosseini, P. A. Lyakhov, M. G. Babenko, M. A. Deryabin 
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
Recommendations
- scientific article
- Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
- Residue-to-binary converters based on new Chinese Remainder Theorems
- High speed residue to binary converter for the new four-moduli set \(\{2^{2n},2^n+1,2^{n/2}+1,2^{n/2}-1\}\)
- An efficient residue to binary converter design
Chinese remainder theoremcomputer arithmeticresidue arithmeticresidue number systemsresidue-to-binary converter
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for computer arithmetic, etc. (65Y04) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
- Computer arithmetic algorithms.
- A Residue-to-Binary Converter for a New Five-Moduli Set
- Radix-8 Booth Encoded Modulo $2 ^{n} -1$ Multipliers With Adaptive Delay for High Dynamic Range Residue Number System
- Residue number systems. Theory and implementation.
- A new high dynamic range moduli set with efficient reverse converter
- 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
- RNS Reverse Converters for Moduli Sets With Dynamic Ranges up to $(8n+1)$-bit
- 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
- A New RNS based DA Approach for Inner Product Computation
- A New Approach to the Design of Efficient Residue Generators for Arbitrary Moduli
Cited In (8)
- An efficient reverse converter for the 4-moduli set [2/sup n/ - 1, 2/sup n, 2/sup n + 1, 2/sup 2n/ + 1] based on the new chinese remainder theorem
- A New Approach to the Design of Efficient Residue Generators for Arbitrary Moduli
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
- Positional characteristics for efficient number comparison over the homomorphic encryption
- Application of the residue number system to reduce hardware costs of the convolutional neural network implementation
- 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
- Hierarchical residue number systems with small moduli and simple converters
This page was built for publication: Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174867)
