The application of core functions to residue number systems
From MaRDI portal
Publication:3358840
Recommendations
- Residue number systems. Theory and applications
- Residue number system implementations of number theoretic transforms in complex residue rings
- Modular multiplication using the core function in the residue number system
- Core Function Based Characterizations Of Number Theoretic Functions
- Residue number systems. Theory and implementation.
- Corresponding residue systems in algebraic number fields
- Towards Robustness in Residue Number Systems
- On the polynomial residue number system (digital signal processing)
- Publication:4953903
- Theoretical foundations of the modified perfect form of residue number system
Cited in
(10)- Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system
- An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code
- Modular multiplication using the core function in the residue number system
- RNS architectures for the implementation of the `diagonal function'
- The factor-2 sign detection algorithm using a core function for RNS numbers
- Reverse conversion using core function, CRT and mixed radix conversion
- A note on RNS architectures for the implementation of the diagonal function
- Core Function Based Characterizations Of Number Theoretic Functions
- Residue number system implementations of number theoretic transforms in complex residue rings
- Core function of an RNS number with no ambiguity
This page was built for publication: The application of core functions to residue number systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358840)