Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: International Forum on Strategic Technology, IFOST 2016 ; Новосибирск, Россия; Новосибирск, Россия
Год издания: 2016
Идентификатор DOI: 10.1109/IFOST.2016.7884163
Ключевые слова: butterfly of Cooley-Tukey algorithm, fast Fourier transform, Discrete Fourier transforms, Complex operations, Cooley-Tukey, Large amounts, Two dimensional (2D) fast Fourier transform, Two dimensional fast Fourier transforms, Fast Fourier transforms
Аннотация: 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 articlПоказать полностьюe 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 IEEE.
Журнал: Proceedings - 2016 11th International Forum on Strategic Technology, IFOST 2016
Номера страниц: 495-498