Ðóñ Eng Cn Translate this page:
Please select your language to translate the article


You can just close the window to don't translate
Library
Your profile

Back to contents

Software systems and computational methods
Reference:

Galanina N.A., Dmitriev D.D. Synthesis of FFT on FPGA using the system of residual classes

Abstract: the presence of the DSP-block and a large number of I/O ports in modern FPGAs allows to use them for a successful synthesis of the digital signal processing algorithms. The system of residual classes involves multithreading of computations, thus FPGAs are very well suited for the implementation of these algorithms, since the computations in the channels of the system of residual classes are carried out in parallel and independent from each other. It is known that the FPGA is a microchip, the logic of which is not determined on creation but is set up by programming in specialized software, such as Quartus II. Developers of the special processors DSP are highly interested in the realization of FFT using the system of residual classes on FPGA Altera Cyclone II. The article shows the results of the development of the conriguration file for realization of FFT using the system of residual classes on FPGA Altera Cyclone II in the development environment Altera Quartus II using the Verilog language of the hardware description. The author describes the FPGA work under the developed configuration file. The article presents timing characteristics and estimated calculation errors.


Keywords:

Software, FPGA, residual classes system, fast Fourier transformation, discrete Fourier transformation, Verilog, Quartus II, configuration file, residual classes system module, residual classes system deduction


This article can be downloaded freely in PDF format for reading. Download article

This article written in Russian. You can find original text of the article here .
References
1. Akushskiy, I.Ya. Mashinnaya arifmetika v ostatochnykh klassakh / I.Ya. Akushskiy, D.I. Yuditskiy. – M.:Sov.radio, 1968. – 440 s.
2. Arndt J. Matters Computational. Ideas, Algorithms, Source Code. – 2011 [Elektronnyy resurs]. URL: http://www.jjj.de/fxt/#fxtbook (data obrashcheniya 08.04.2012).
3. Galanina, N.A. Nepozitsionnye algoritmy i ustroystva tsifrovoy fil'tratsii i spek-tral'nogo analiza / N.A. Galanina. – Cheboksary: Izd-vo Chuvash. un-ta, 2009. – 208 s.
4. Lebedev, E.K. Optimal'nye algoritmy BPF v SOK / E.K. Lebedev, N.A. Gala nina // Per-spektivnye tekhnologii v sredstvakh peredachi informatsii: sb. tezisov dokl. I Mezhdu-nar. konf. – Vladimir: Izd-vo Vlad. politekh. un-ta, 1995. – S. 118-119