SUMMARY
Context. A method of efficient computation of DFT using cyclic convolutions for sizes of integer power of two has been considered.The further development of Winograd Fourier transform algorithm based on a hashing array has been proposed. The research object is theprocess of the reformulation the basis matrix of DFT into the block-cyclic structures. The research subject lays in the technique of thereformulation the basis matrix of DFT for sizes of integer power of two into the block-cyclic structures.Objective. The purpose of the work is the analysis of the structure specifics the left-circulant submatrices of the basis square matrixWN for sizes of transform N = 2i using the hashing arrays.Method. The article considers a technique for the efficient computation of DFT using cyclic convolutions for sizes of integer powerof two, which is based on the cyclic decomposition of substitution. A hashing array has been proposed for the compressed description of theblock-cyclic structure of discrete basis matrix and for the efficient computation of DFT for sizes of integer power of two.Results. A generalized block-cyclic structure of discrete basis matrix for the efficient computation of DF using cyclic convolutions forsizes of an integer power of two based on the hashing arrays has been determined. The proposed technique is relevant for concurrentprogramming of DFT and for its implementation in parallel systems.Conclusions. A general block-cyclic structure of basis matrix of DFT is regularly formed with an increase in the value of the exponentof two and is recommended for use in practice when developing the efficient means of DFT. The prospects for further research will includethe formation of block-cyclic structure of basis matrix of DFT for arbitrary sizes.
KEYWORDS