Unified approach to the development of fast algorithms and parallel implementation of discrete Fourier transform

A unified group theoretical approach to the development of fast algorithms and parallel implementation of Discrete Fourier Transform is proposed, Meth ods of decomposition of Discrete Fourier Transform developed within this ap proach are described. These methods are based on the formation of the decom position process and are characterized by the rubs of such formation. The a pplication of the proposed methods directly leads to the development of a s et of fast parallel algorithms for Discrete Fourier Transforms. Common feat ures of the formed algorithms are their lack of decomposition redundancy an d structural flexibility, which allows the parameters to be tuned to any de gree and mode of parallelism.