On parallel calculations for discrete Fourier transformation
Matematičeskoe modelirovanie, Tome 2 (1990) no. 4, pp. 88-96
The problem of asymptotic estimate of the time complexity of numerical Fourier transformation is considered. The conditions are found under which a well known estimation may be achieved. It is shown that a contradiction between FFT and DFT under these conditions is not reasonable.
@article{MM_1990_2_4_a7,
author = {V. A. Leus},
title = {On parallel calculations for discrete {Fourier} transformation},
journal = {Matemati\v{c}eskoe modelirovanie},
pages = {88--96},
year = {1990},
volume = {2},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MM_1990_2_4_a7/}
}
V. A. Leus. On parallel calculations for discrete Fourier transformation. Matematičeskoe modelirovanie, Tome 2 (1990) no. 4, pp. 88-96. http://geodesic.mathdoc.fr/item/MM_1990_2_4_a7/