Search

Copyright of Annals of Telecommunications is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Cet article décrit un algorithme de transformation de Fourier rapide proposé récemment, qui présente des avantages en complexité de calcul, occupation mémoire et régularité de structure. Après avoir brièvement décrit l'algorithme à double base dans le cas de signaux complexes, l'application aux cas de signaux réels et réels symétriques est examinée, ainsi que le lien avec un algorithme optimal quant au nombre de multiplications complexes non triviales. A detailed description of a recent algorithm for the fast computation of the discrete Fourier transform is presented. This algorithm has some advantages when considering computational complexity, « in place» computation, and regularity of its implementation. After briefly recalling the split-radix algorithm in the case of complex data, we show how it can be adapted to real and real symmetrical data. Finally, we enlight the relationship between split-radix algorithm, and an algorithm with minimum number of non-trivial complex multiplication. [ABSTRACT FROM AUTHOR]