Computational structure of adaptive to transform size FFT

The proposed computation adaptive to transform size FFT (class of Fourier transform or discrete harmonic transforms) is based on cyclic convolutions. The discrete basis matrices of transform are presented of cyclic submatrices defining the efficient model of execution. The control-flow and dataflow structures is considered for proposed computational approach of discrete harmonic transforms.