论文信息 - Polynomial residue complex signal processing

Polynomial residue complex signal processing

The polynomial residue number system (PRNS) is a system in which the product of two polynomials can take place in parallel and with the minimum number of multiplications. The system is an extension of the quadratic residue number system (QRNS) which has been successfully used in complex digital signal processing. It is shown that an N-point complex linear convolution can be computed with 4N real multiplications when using the PRNS instead of 22 real multiplications when using the QRNS. The savings in the number of multiplications occur if some restrictions are placed on the modular ring used for performing the complex residue number system operations. >

Thanos Stouraitis | A. Skavantzos

[1] Fred J. Taylor,et al. A Radix-4 FFT Using Complex RNS Arithmetic , 1985, IEEE Transactions on Computers.

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

[3] F. Taylor,et al. On the Polynomial Residue Number System , 1991 .

[4] Fred J. Taylor,et al. On the polynomial residue number system [digital signal processing] , 1991, IEEE Trans. Signal Process..

[5] Graham A. Jullien,et al. On Modulus Replication for Residue Arithmetic Computations of Complex Inner Products , 1990, IEEE Trans. Computers.

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

[7] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .

[8] A. Skavantzos,et al. Computing large polynomial products using modular arithmetic , 1992 .

[9] G. Jullien,et al. The modified quadratic residue number system (MQRNS) for complex high-speed signal processing , 1986 .

[10] Application of Quadratic-Like complex residue number system arithmetic to ultrasonics , 1984, ICASSP.