POLYNOMIAL RESIDUE COMPLEX SIGNAL-PROCESSING

The polynomial residue number system (PRNS) is a system in which the p roduct of two polynomials can take place in parallel and with the mini mum number of multiplications. The system is an extension of the quadr atic residue number system (QRNS) which has been successfully used in complex digital signal processing. The paper shows that an N-point com plex linear convolution can be computed with 4N real multiplications w hen using the PRNS instead of 2N2 real multiplications when using the QRNS. The savings in the number of multiplications occur if some restr ictions are placed on the modular ring used for performing the complex residue number system operations.