Hardware realization of residue number system algorithms by Boolean functions minimization

TL;DR

This paper presents a hardware implementation of residue number system algorithms using Boolean function minimization, achieving significant performance improvements over existing industrial tools.

Contribution

It introduces a novel Boolean minimization-based approach for hardware realization of RNS algorithms, notably modular multiplication and modulo functions.

Findings

Performance up to 30 times faster than industrial tools

Efficient hardware implementation of RNS algorithms

Boolean minimization significantly improves RNS hardware design

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.