The application of core functions to residue number systems

DOI10.1109/78.80766zbMath0732.11070OpenAlexW2011654054MaRDI QIDQ3358840

James Gonnella

Publication date: 1991

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/78.80766

zbMATH Keywords

core functionslook-up table cyclenonmodular operationresidue number arithmeticskin function

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Computational number theory (11Y99)

Related Items (8)

RNS architectures for the implementation of the `diagonal function' ⋮ The factor-2 sign detection algorithm using a core function for RNS numbers ⋮ Modular multiplication using the core function in the residue number system ⋮ Reverse conversion using core function, CRT and mixed radix conversion ⋮ Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system ⋮ A note on RNS architectures for the implementation of the diagonal function ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code ⋮ Core function of an RNS number with no ambiguity

This page was built for publication: The application of core functions to residue number systems