Residue number systems. Theory and implementation.
From MaRDI portal
Publication:5424092
Recommendations
Cited in
(38)- The application of core functions to residue number systems
- Multiple-base number system. Theory and applications.
- Efficient reverse converters for 4-moduli sets \(\{2^{2n-1}-1, 2^n,2^n+1,2^n-1\}\) and \(\{2^{2n-1},2^{2n-1}-1, 2^n+1,2^n-1\}\) based on CRTs algorithm
- Scaling in residue number systems
- A method for implementing the operation of modulo addition of the residues of two numbers in the residue number system
- Positional characteristics for efficient number comparison over the homomorphic encryption
- Method for implementing the arithmetic operation of addition in residue number system based on the use of the principle of circular shift
- Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)
- Application of the residue number system to reduce hardware costs of the convolutional neural network implementation
- Symmetric encryption algorithms in a polynomial residue number system
- Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system
- Designing efficient two-level reverse converters for moduli set \(\{2^{2n+1}-1,2^{2n},2^{n}-1\}\)
- An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code
- A method for arithmetic comparison of data represented in a residue number system
- Modular multiplication using the core function in the residue number system
- Implementation of FFT Structures Using the Residue Number System
- Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
- Modular arithmetic and its applications in info-communication technologies
- Theoretical foundations of the modified perfect form of residue number system
- scientific article; zbMATH DE number 796292 (Why is no real title available?)
- Efficient Hardware Operations for the Residue Number System by Boolean Minimization
- Residue number systems. Theory and applications
- An approximate method for comparing modular numbers and its application to the division of numbers in residue number systems
- Quadruples for residue number systems with sum of quotients a power of a prime
- RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
- scientific article; zbMATH DE number 3995751 (Why is no real title available?)
- Application of the neural network computing technology for calculating the interval-index characteristics of a minimally redundant modular code
- Controlling and restoring the integrity of multi-dimensional data arrays through cryptocode constructs
- Floating-point numbers in residue number systems
- Reverse conversion using core function, CRT and mixed radix conversion
- Finite precision number systems and arithmetic
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
- Implementation schemes for basic modular operations
- Residue number system implementations of number theoretic transforms in complex residue rings
- scientific article; zbMATH DE number 3291608 (Why is no real title available?)
- scientific article; zbMATH DE number 1941100 (Why is no real title available?)
- Integer division in residue number systems
- A new approach to fixed-coefficient inner product computation over finite rings
This page was built for publication: Residue number systems. Theory and implementation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5424092)
