Mod \(m\) arithmetic in binary systems

DOI10.1016/0020-0190(91)90198-QzbMath0741.68054OpenAlexW2077437144MaRDI QIDQ1183492

Ferruccio Barsi

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90198-q

zbMATH Keywords

modular arithmeticresidue arithmeticVLSI complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Congruences; primitive roots; residue systems (11A07) Mathematical problems of computer architecture (68M07)

Related Items (1)

A fully parallel algorithm for residue to binary conversion

Cites Work

• Concurrent detection of additive overflow and arithmetic errors in residue codes
• Area—Time optimal VLSI integer multiplier with minimum computation time
• A Regular Layout for Parallel Adders
• Residue Number Scaling and Other Operations Using ROM Arrays

This page was built for publication: Mod \(m\) arithmetic in binary systems