Title :
Efficient Class of Redundant Residue Number System
Author :
Timarchi, Somayeh ; Navi, Keivan
Author_Institution :
Shahid Beheshti Univ., Tehran
Abstract :
The residue number system is suitable for implementing high-speed digital processing devices because it supports parallel, modular, fault-tolerant and carry-bounded arithmetic. The carry propagation is restricted to inside the modulus. The remaining intra moduli carry propagation limits the speed of arithmetic operation. Therefore the carry-free property of redundant arithmetic can be used. In this paper, we discuss a novel class of redundant high-radix RNS based on the stored-unibit transfer representation for modulo 2n+1 that improves the performance of conventional redundant RNS and provides a desired tradeoff between area and delay complexity.
Keywords :
computational complexity; fault tolerant computing; residue number systems; carry-bounded arithmetic; delay complexity; fault-tolerant arithmetic; high-radix RNS; high-speed digital processing devices; intra moduli carry propagation limits; redundant residue number system; stored-unibit transfer representation; Concurrent computing; Delay; Digital arithmetic; Digital signal processing; Discrete Fourier transforms; Discrete transforms; Encoding; Error correction; Fault tolerant systems; Hardware; Signed-Digit (SD) number system; Stored-Unibit Transfer (SUT) representation; carry-free computations; parallel arithmetic; redundant residue number system;
Conference_Titel :
Intelligent Signal Processing, 2007. WISP 2007. IEEE International Symposium on
Conference_Location :
Alcala de Henares
Print_ISBN :
978-1-4244-0830-6
Electronic_ISBN :
978-1-4244-0830-6
DOI :
10.1109/WISP.2007.4447506
