Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: IFOST-2016; Novosibirsk; Novosibirsk
Год издания: 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 onedimensional 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.
Журнал: Proceedings of IFOST-2016
Выпуск журнала: Part 1
Номера страниц: 495-498
Издатель: Новосибирский государственный технический университет