About multidimensional analog of algorithm of Cooley-Tukey

Бесплатный доступ

In this article, recurring sequences of orthogonal basis in n-dimensional case has being applied for express of formulas of the n-dimensional fast Fourier transformation, which using 2п-1 / 2п × Nnlog2N complex multiplication and nNnlog2N complex addition, where N = 2s - number of counting on one of the axis.

Space of signals, orthogonal basis sequence, multidimensional discrete fourier transform

Короткий адрес: https://sciup.org/148176151

IDR: 148176151

Статья обзорная