DISCRETE FOURIER TRANSFORM METHOD THAT DOES NOT REQUIRE MULTIPLICATION OPERATIONS.

This paper offers a method of implementing the approach that yields estimates for the Fourier coefficients over the entire frequency range of transformation, by scaling of the intermediate coefficients corresponding to the procedure for decomposing the signal being processed in the chosen system of rpf, without operations of multiplication of multiple-digit numbers altogether. Examples of possible systems of rpf and a structural diagram of a DFT processor that implements the proposed method are given. Comparative estimates are made for the speed or processors that implement the DFT on the basis of the method of discrete transforms in systems of rpf, and of DFT processors that implement direct and fast Fourier transform algorithms, for a real-time transformation mode.