Title :
Polynomial residue complex signal processing
Author :
Skavantzos, Alexander ; Stouraitis, Thanos
Author_Institution :
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
fDate :
5/1/1993 12:00:00 AM
Abstract :
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
Keywords :
digital arithmetic; signal processing; N-point complex linear convolution; PRNS; complex digital signal processing; modular ring; polynomial residue number system; quadratic residue number system; Autocorrelation; Circuits; Concurrent computing; Convolution; Digital arithmetic; Digital signal processing; Performance evaluation; Polynomials; Signal processing; Signal processing algorithms;
Journal_Title :
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
