Core function of an RNS number with no ambiguity

DOI10.1016/J.CAMWA.2005.03.008zbMath1115.68008OpenAlexW2082000319MaRDI QIDQ814318

N. E. Zubov

Publication date: 6 February 2006

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.03.008

zbMATH Keywords

AlgorithmChinese remainder theoremCore functionModuli setModulusResidue number system

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07)

Related Items (3)

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 ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code

Cites Work

• Unnamed Item
• The application of core functions to residue number systems
• VLSI implementation of residue adders based on binary adders
• High-speed and reduced-area modular adder structures for RNS
• A new technique for fast number comparison in the residue number system

This page was built for publication: Core function of an RNS number with no ambiguity