Core function of an RNS number with no ambiguity

DOI10.1016/J.CAMWA.2005.03.008MaRDI QIDQ814318zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Reverse conversion using core function, CRT and mixed radix conversion
• The application of core functions to residue number systems
• The factor-2 sign detection algorithm using a core function for RNS numbers
• $N$-Sequence RSNS Ambiguity Analysis
• A new residue number system division algorithm

Cites work

• A new technique for fast number comparison in the residue number system
• High-speed and reduced-area modular adder structures for RNS
• scientific article; zbMATH DE number 3269473 (Why is no real title available?)
• The application of core functions to residue number systems
• VLSI implementation of residue adders based on binary adders

Cited in

(3)

• Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system
• Reverse conversion using core function, CRT and mixed radix conversion
• An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814318)