On parallel calculations for discrete Fourier transformation
Matematičeskoe modelirovanie, Tome 2 (1990) no. 4, pp. 88-96.

Voir la notice de l'article provenant de la source Math-Net.Ru

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},
     publisher = {mathdoc},
     volume = {2},
     number = {4},
     year = {1990},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MM_1990_2_4_a7/}
}
TY  - JOUR
AU  - V. A. Leus
TI  - On parallel calculations for discrete Fourier transformation
JO  - Matematičeskoe modelirovanie
PY  - 1990
SP  - 88
EP  - 96
VL  - 2
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MM_1990_2_4_a7/
LA  - ru
ID  - MM_1990_2_4_a7
ER  - 
%0 Journal Article
%A V. A. Leus
%T On parallel calculations for discrete Fourier transformation
%J Matematičeskoe modelirovanie
%D 1990
%P 88-96
%V 2
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MM_1990_2_4_a7/
%G ru
%F 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/