An O(n) Residue Number System to Mixed Radix Conversion technique

This paper investigates the conversion of Residue Number System (RNS) operands to decimal, which is an important issue concerning the utilization of RNS numbers in digital signal processing applications. In this line of reasoning, we introduce an RNS to Mixed Radix Conversion (MRC) technique, which addresses the computation of Mixed Radix (MR) digits in such a way that enables the MRC parallelization. Given an RNS with the set of relatively prime integer moduli {mi}i=1;n, the key idea behind the proposed technique is to maximize the utilization of the modulo-mi adders and multipliers present in the RNS processor functional units. For an n-digit RNS number X = (x1; x2; x3; …; xn) the method requires n iterations. However, at iteration i, the modulo-mi units are utilized for the calculation of the MR digit ai, while the other modulo units are calculating intermediate results required in further iterations. Our approach results in an RNS to MRC with an asymptotic complexity, in terms of arithmetic operations, in the order of O(n), while state of the art MRCs exhibit an asymptotic complexity in the order of O(n2). More in particular, when compared with the best state of the art MRC, our technique reduces the number of arithmetic operations by 5:26% and 38:64% for moduli set of length four and ten, respectively.

[1]  W. R. Moore,et al.  Improved mixed-radix conversion for residue number system architectures , 1991 .

[2]  A. Hiasat.  Efficient residue to binary converter , 2003 .

[3]  C. H. Huang.  A Fully Parallel Mixed-Radix Conversion Algorithm for Residue Number Applications , 1983, IEEE Transactions on Computers.

[4]  W. Kenneth Jenkins,et al.  The use of residue number systems in the design of finite impulse response digital filters , 1977 .

[5]  S. Cotofana,et al.  Residue Number System operands to decimal conversion for 3-moduli sets , 2008, 2008 51st Midwest Symposium on Circuits and Systems.

[6]  I. Flores.  Residue Arithmetic and Its Application to Computer Technology (Nicholas S. Szabo and Richard I. Tanaka) , 1969 .

[7]  S. Cotofana,et al.  A residue to binary converter for the {2n + 2, 2n + 1, 2n} moduli set , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[8]  M.N.S. Swamy,et al.  Residue to binary number converters for three moduli set , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[9]  H. M. Yassine.  Fast arithmetic based on residue number system architectures , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[10]  Richard I. Tanaka,et al.  Residue arithmetic and its applications to computer technology , 1967 .

[11]  Harvey L. Garner,et al.  RESIDUE NUMBER SYSTEM ENHANCEMENTS FOR PROGRAMMABLE PROCESSORS , 2008 .

[12]  M.N.S. Swamy,et al.  Residue-to-binary number converters for three moduli sets , 1999 .

[13]  N. M. Yassine.  Matrix mixed-radix conversion for RNS arithmetic architectures , 1991, [1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems.

[14]  W. S. McCormick,et al.  An arithmetic free parallel mixed-radix conversion algorithm , 1998 .

[15]  Graham A. Jullien,et al.  Residue Number Scaling and Other Operations Using ROM Arrays , 1978, IEEE Transactions on Computers.

[16]  M. Omair Ahmad,et al.  A high-speed residue-to-binary converter and a scheme for its VLSI implementation , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[17]  Wei Wang,et al.  An area-time-efficient residue-to-binary converter , 2000, Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems (Cat.No.CH37144).

[18]  A. L. Narasimha Reddy,et al.  An Implementation of Mixed-Radix Conversion for Residue Number Applications , 1986, IEEE Transactions on Computers.