Enhancing Computational Efficiency in Intensive Domains via Redundant Residue Number Systems
Soudabeh Mousavi, Dara Rahmati, Saeid Gorgin, Jeong-A Lee

TL;DR
This paper explores the fusion of redundant number systems with residue number systems (R-RNS) to improve computational efficiency in digital signal processing, encryption, and neural networks, demonstrating significant speed and energy savings.
Contribution
It introduces the R-RNS approach, combining redundant and residue number systems, and evaluates its performance against traditional systems using neural network benchmarks.
Findings
SD-RNS achieves 1.27x speedup over RNS
SD-RNS achieves 2.25x speedup over BNS
Energy consumption reduced by 60% with SD-RNS
Abstract
In computation-intensive domains such as digital signal processing, encryption, and neural networks, the performance of arithmetic units, including adders and multipliers, is pivotal. Conventional numerical systems often fall short of meeting the efficiency requirements of these applications concerning area, time, and power consumption. Innovative approaches like residue number systems (RNS) and redundant number systems have been introduced to surmount this challenge, markedly elevating computational efficiency. This paper examines from multiple perspectives how the fusion of redundant number systems with RNS (termed R-RNS) can diminish latency and enhance circuit implementation, yielding substantial benefits in practical scenarios. We conduct a comparative analysis of four systems - RNS, redundant number system, Binary Number System (BNS), and Signed-Digit Redundant Residue Number…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Cryptography and Data Security · Advanced Data Storage Technologies
