An approximate method for comparing modular numbers and its application to the division of numbers in residue number systems

DOI10.1007/S10559-014-9689-2zbMath1327.68340OpenAlexW1971283446MaRDI QIDQ891120

M. G. Babenko, N. I. Chervyakov, I. N. Lavrinenko, P. A. Lyakhov

Publication date: 16 November 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-014-9689-2

zbMATH Keywords

algorithmdivisionresidue number systemmodular arithmetic

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel DNA arithmetic operation based on \(n\)-moduli set
• Use of modular coding for high-speed digital filter design
• A division algorithm for residue numbers

This page was built for publication: An approximate method for comparing modular numbers and its application to the division of numbers in residue number systems