Parallel Discrete Fourier Transform Algorithm Analysis

Authors

  • K. Kazlauskas Vilnius University

Abstract

Discrete Fourier transform is widely used for digital signal processing. In the paper, a parallel discrete Fourier transform algorithm is analysed. The algorithm, as compared with the direct discrete Fourier transform algorithm, has a considerably smaller number of operations and increased processing speed. The parallel algorithm can be realised in a parallel manner using fast Fourier transform processors. The complexity of the parallel discrete Fourier transform algorithm is discussed. The optimal number of the fast Fourier transform processors is found. It is shown that the hardware realization of the parallel discrete Fourier transform algorithm is more complicated, because it uses more than one processor, but considerably faster as compared with nonparallel hardware realization of the fast Fourier transform algorithm. Bibl. 5 (in Lithuanian; summaries in Lithuanian, English, Russian).

Downloads

Published

2005-02-01

How to Cite

Kazlauskas, K. (2005). Parallel Discrete Fourier Transform Algorithm Analysis. Elektronika Ir Elektrotechnika, 58(2). Retrieved from https://eejournal.ktu.lt/index.php/elt/article/view/10349

Issue

Vol. 58 No. 2 (2005)

Section

T 121 SIGNAL TECHNOLOGY

License

The copyright for the paper in this journal is retained by the author(s) with the first publication right granted to the journal. The authors agree to the Creative Commons Attribution 4.0 (CC BY 4.0) agreement under which the paper in the Journal is licensed.

By virtue of their appearance in this open access journal, papers are free to use with proper attribution in educational and other non-commercial settings with an acknowledgement of the initial publication in the journal.