Geodesic
On the time complexity of digital Fourier transform parallel computing
Matematičeskoe modelirovanie, Tome 7 (1995) no. 10, pp. 99-110 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Modern trend to parallel implementing the discrete Fourier transform (DFT) – the basis of digital signal processing – is analysed. The one-dimensional DFT is demonstrated to have decisive advantages over fast Fourier transform. A calculating model at the many-channel pipeline achitecture (without any crossing data flows) to compute the two-dimensional DFT in the shortest time is proposed. It is shown that all aspirations to achieve an absolut paralleling in computing ttr multy-dimensionai DFT are unfeasible. 
@article{MM_1995_7_10_a6,
     author = {V. A. Leus},
     title = {On the time complexity of digital {Fourier} transform parallel computing},
     journal = {Matemati\v{c}eskoe modelirovanie},
     pages = {99--110},
     year = {1995},
     volume = {7},
     number = {10},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MM_1995_7_10_a6/}
}
TY  - JOUR
AU  - V. A. Leus
TI  - On the time complexity of digital Fourier transform parallel computing
JO  - Matematičeskoe modelirovanie
PY  - 1995
SP  - 99
EP  - 110
VL  - 7
IS  - 10
UR  - http://geodesic.mathdoc.fr/item/MM_1995_7_10_a6/
LA  - ru
ID  - MM_1995_7_10_a6
ER  - 
%0 Journal Article
%A V. A. Leus
%T On the time complexity of digital Fourier transform parallel computing
%J Matematičeskoe modelirovanie
%D 1995
%P 99-110
%V 7
%N 10
%U http://geodesic.mathdoc.fr/item/MM_1995_7_10_a6/
%G ru
%F MM_1995_7_10_a6
V. A. Leus. On the time complexity of digital Fourier transform parallel computing. Matematičeskoe modelirovanie, Tome 7 (1995) no. 10, pp. 99-110. http://geodesic.mathdoc.fr/item/MM_1995_7_10_a6/