On the structure of efficient DFT algorithms

This paper examines the structure of the prime length DFT algorithms that are developed by Winograd´s approach. It is shown that these algorithms have considerable structure and that this can be exploited to develop a straight forward design procedure that does not use the Chinese remainder theorem. This structure also allows the design of real - data programs, and the improvement the data transfer properties of the PFA.