Transformations de Fourier discrètes: algorithmes rapides

This paper reviews some discret Fourier transform algorithms: the algorithms with prime recursive radix, 2^k radix, non regular division, short algorithms, prime factor and Winograd ones are considered. For each of them, the technique to built the algorithm is resumed and algebraic properties on basic ideas used are pointed out. The most important properties of the algorithms are shown underlying the links between criteria choice and implementation of algorithms. In particular, the computational load of the algorithms is analysed.