A multidimensional analog of the Cooley-Tukey FFT algorithm
Автор: Starovoitov A.V.
Журнал: Сибирский аэрокосмический журнал @vestnik-sibsau
Рубрика: Математика, механика, информатика
Статья в выпуске: 7 (33), 2010 года.
Бесплатный доступ
In this article a recurring sequence of orthogonal basis in the n-dimensional case has been applied to derive formulas of n-dimensional fast Fourier transform algorithm, which uses Complex multiplication and nN n log 2 N complex addition; where N = 2 s – is a number of counts on one of the axes.
Space of signals, orthogonal basis sequence, multidimensional discrete fourier transform
Короткий адрес: https://sciup.org/148176425
IDR: 148176425
Статья научная
