Hardware realization of residue number system algorithms by Boolean functions minimization

2018/08/09 by Gorodecky, Danila, Villa, Tiziano
#FOS: Computer and information sciences #Hardware Architecture (cs.AR)

paper · doi:10.48550/arxiv.1808.03083

Abstract

Residue number systems (RNS) represent numbers by their remainders modulo a set of relatively prime numbers. This paper pro- poses an efficient hardware implementation of modular multiplication and of the modulo function (X(mod P)), based on Boolean minimiza- tion. We report experiments showing a performance advantage up to 30 times for our approach vs. the results obtained by state-of-art industrial tools.

Related

• A Multi-layer Recursive Residue Number System
• Design Of A Reconfigurable DSP Processor With Bit Efficient Residue Number System
• Introduction of the Residue Number Arithmetic Logic Unit With Brief Computational Complexity Analysis
• Efficient Implementations of Residue Generators Mod 2n + 1 Providing Diminished-1 Representation
• New Residue Arithmetic Based Barrett Algorithms, Part I: Modular Integer Computations