Сибирский федеральный университет

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: International Forum on Strategic Technology (IFOST); Novosibirsk, RUSSIA; Novosibirsk, RUSSIA

Год издания: 2016

Ключевые слова: fast Fourier transform, butterfly of Cooley-Tukey algorithm

Аннотация: One-and two-dimensional (2D) fast Fourier transform (FFT) algorithms has been widely used in digital processing. 2D discrete Fourier transform is reduced to a combination of one-dimensional FFT for all coordinates due to the increased complexity and the large amount of computation by increasing dimension of the signal. This article provides the butterfly of analog Cooley-Tukey algorithm, which requires less complex operations of additional and multiplication than the standard method, and runs 1.5 times faster than analogue in Matlab.

Журнал: 2016 11TH INTERNATIONAL FORUM ON STRATEGIC TECHNOLOGY (IFOST), PTS 1 AND 2

Место издания: NEW YORK

Издатель: IEEE

• Tutatchikov V.S. (Siberian Fed Univ, Inst Space & Informat Technol, Krasnoyarsk, Russia)

• Web of Science Core Collection