Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: International Conference on Information Technology and Nanotechnology (IEEE ITNT); Samara, RUSSIA; Samara, RUSSIA
Год издания: 2020
Идентификатор DOI: 10.1109/ITNT49337.2020.9253305
Ключевые слова: cooley-tukey fft, fast fourier transform, parallel fft algorithm
Аннотация: Currently, two-dimensional fast Fourier transform (FFT) is widely used in digital signal processing. It is usually calculated using a combination of one-dimensional FFTs, first for each row, then for each column. In this case, the algorithm is easily adapted for parallel computing. The paper presents a method of parallelizing the aПоказать полностьюlgorithm for calculating a two-dimensional FFT using an analogue of the Cooley-Tukey algorithm, which requires fewer operations of complex addition and complex multiplication than the standard method. The main difficulty in parallelizing this algorithm is that the two-dimensional analogue of the Cooley-Tukey algorithm is iteratively performed in s passes with the size of the initial signal 2
Журнал: Proceedings of ITNT 2020 - 6th IEEE International Conference on Information Technology and Nanotechnology
Номера страниц: 9253305
Издатель: Institute of Electrical and Electronics Engineers Inc.