论文信息 - A Look-Up Scheme for Scaling in the RNS

A Look-Up Scheme for Scaling in the RNS

Previous scaling schemes have used iterative algorithms, which lead to computation time and memory requirements that increase with the number of moduli. This paper presents a two look-up cycle scaling scheme which allows a diminution of the required memory when nonlarge sets of moduli are considered. This scheme can be combined with previous algorithms for larger sets of moduli.

Antonio García | Antonio Lloris-Ruíz

[1] Michael A. Soderstrand,et al. Residue number system arithmetic: modern applications in digital signal processing , 1986 .

[2] F. J. Taylor,et al. Residue Arithmetic A Tutorial with Examples , 1984, Computer.

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

[4] Erich Kaltofen,et al. Integer Division in Residue Number Systems , 1995, IEEE Trans. Computers.

[5] A. G. J. Holt,et al. New transform using the Mersenne numbers , 1995 .

[6] Fred J. Taylor,et al. Pipelined Hogenauer CIC filters using field-programmable logic and residue number system , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[7] Hao-Yung Lo,et al. An Algorithm for Scaling and Single Residue Error Correction in Residue Number Systems , 1990, IEEE Trans. Computers.

[8] T Higuchi,et al. A new scaling algorithm in symmetric residue number system based on multiple-valued logic , 1986 .

[9] Mi Lu,et al. A Novel Division Algorithm for the Residue Number System , 1992, IEEE Trans. Computers.