| Номер документа в системі: | 356041 |
| Автор: | Prots'ko I. O., Teslyuk V. M. |
| Назва документа: | Development of WFTA based on the hashing array = Розвиток АВПФ на основі твірного масиву |
| УДК | 004.421.2+517.443 |
| Мова документу | Англійська |
| Аннотація | 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 the process of the reformulation the basis matrix of DFT into the block-cyclic structures. The research subject lays in the technique of the reformulation 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 matrix WN 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 power of two, which is based on the cyclic decomposition of substitution. A hashing array has been proposed for the compressed description of the block-cyclic structure of discrete bas |
| Кількість сторінок | С. 135-142. |