Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
The paper presents the hardware implementation of the elementary computations, termed the butterflies, of the convolution realized with a use of the Polynomial Residue Number System (PRNS). The computations are performed with the use of the diminished-1 number representation. The synthesis of the butterflies in the Xilinx ISE environment with Virtex 4 model is described, the hardware amount and pipelining rate are also given.
Słowa kluczowe
Rocznik
Tom
Strony
97--104
Opis fizyczny
Bibliogr. 5 poz., rys.
Bibliografia
- [1] 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.
- [2] 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.
- [3] 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.
- [4] Paliouras V., Skavantzos A.: Novel forward and inverse PRNS converters of reduced computational complexity. Conference on Signals, Systems and Computers, Nov. 3-6, 2002, Conference Record of the Thirty-Sixth Asilomar, vol. 2, pp. 1603 - 1607.
- [5] Duhamel P., Vetterli M.: Fast Fourier transforms: A tutorial review and a state of the art. Elsevier Science-NL, Signal Processing 19, pp. 259-299, 1990.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-dac81bdf-c3b0-4a6b-8af0-d7926409c25f