The following pages link to (Q5424092):
Displaying 12 items.
- 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 (Q531242) (← links)
- An approximate method for comparing modular numbers and its application to the division of numbers in residue number systems (Q891120) (← links)
- Application of the residue number system to reduce hardware costs of the convolutional neural network implementation (Q1998097) (← links)
- Controlling and restoring the integrity of multi-dimensional data arrays through cryptocode constructs (Q2064389) (← links)
- Positional characteristics for efficient number comparison over the homomorphic encryption (Q2217212) (← links)
- Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system (Q2230727) (← links)
- Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even) (Q2333101) (← links)
- Designing efficient two-level reverse converters for moduli set \(\{2^{2n+1}-1,2^{2n},2^{n}-1\}\) (Q2338341) (← links)
- Reverse conversion using core function, CRT and mixed radix conversion (Q2405464) (← links)
- Modular multiplication using the core function in the residue number system (Q2634582) (← links)
- Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem (Q3174867) (← links)
- Quadruples for Residue Number Systems with Sum of Quotients a Power of a Prime (Q5868046) (← links)
