About multidimensional analog of algorithm of Cooley-Tukey

Free access

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

Short address: https://sciup.org/148176151

IDS: 148176151   |   UDC: 519.677