Two-dimensional fast Fourier transform: Batterfly in analog of Cooley-Tukey algorithm
Скачать файл:
URI (для ссылок/цитирований):
http://ieeexplore.ieee.org/document/7884163/https://elib.sfu-kras.ru/handle/2311/69969
Дата:
2017-03Журнал:
Proceedings of IFOST-2016 11th International Forum on Strategic TechnologyКвартиль журнала в Scopus:
без квартиляБиблиографическое описание:
Тутатчиков, Валерий Сергеевич. Two-dimensional fast Fourier transform: Batterfly in analog of Cooley-Tukey algorithm [Текст] / Валерий Сергеевич Тутатчиков // Proceedings of IFOST-2016 11th International Forum on Strategic Technology: IFOST-2016. — 2017. — № 1. — С. 495-498Текст статьи не публикуется в открытом доступе в соответствии с политикой журнала.
Аннотация:
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.