Reduction of the number of multiplication operations in digital signal processing algorithms by classical methods of discrete Fourier transform
Adeliya Yu. Burova, Anatoly V. Ryapukhin
Abstract
The issues related to the problem of minimizing hardware costs in software and hardware implementation of digital algorithms of discrete Fourier transform (DFT) are considered. Possible ways of solving these problems based on the use of digital algorithms of classical methods of DFT are described. Various digital methods of direct, fast and recurrent DFT (RDFT) and number-theoretic Mersenne transforms are investigated. The purpose of the research is a comparative analysis of these methods. The research used methods of mathematical and software modeling of digital signal processing (DSP) algorithms. A comparative analysis of classical methods of DFT, which allows minimizing the required number of multiplication operations in DSP algorithms, is carried out. The results of this analysis are presented.