Discrete convolution based on polynomial residue representation

• Autorzy: Smyk R.
• Konferencja: Computer Applications in Electrical Engineering 2010 [Poznań, April 19-21, 2010]
• Języki publikacji: EN

Abstrakty

EN

This paper presents the study of fast discrete convolution calculation with use of the Polynomial Residue Number System (PRNS). Convolution can be based the algorithm similar to polynomial multiplication. The residue arithmetic allows for fast realization of multiplication and addition, which are the most important arithmetic operations in the implementation of convolution. The practical aspects of hardware realization of PRNS convolution in Xilinx FPGA are also presented.

Słowa kluczowe

EN

polynomial residue number system; PRNS; arithmetic operation

PL

PRNS; operacja arytmetyczna

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Poznan University of Technology Academic Journals. Electrical Engineering
• Rocznik: 2010
• Tom: No. 63
• Strony: 167--173
• Opis fizyczny: Bibliogr. 6 poz.

Twórcy

autor

Smyk R.

• Gdansk University of Technology

Bibliografia

• [1] Hwang K.: Computer arithmetic. John Wiley & Sons Inc, April 4, 1979.
• [2] Skavantzos A., Taylor F.J.: On the polynomial residue number system. IEEE Transactions on Signal Processing, Vol.39, No. 2, pp. 376-382, February 1991.
• [3] Skavantzos A., Mitash N.: Computing large polynomial products using modular arithmetic. IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, vol. 39, no. 4, pp. 252-254, April 1992.
• [4] Paliouras V., Skavantzos A.: Novel forward and inverse PRNS converters of reduced computational complexity. IEEE, 2002.
• [5] Leibowitz L.M.: A simplified binary arithmetic for the Fermat number transform. IEEE Transactions on Acoustics, Speech, and Signal Processing, Vol. ASSP-24, pp 356-359, October 1976.
• [6] Duhamel P., Vetterli M.: Fast Fourier transforms: A tutorial review and a state of the art. ElsevierScience-NL, Signal Processing 19:259-299, 1990.