DEVELOPMENT OF FAST ALGORITHM FOR COMPUTING NUMBER-THEORETIC TRANSFORMS OF SIGNALS
The aim of the research is to increase the speed of execution of orthogonal transformation of signals when using number-theoretic transforms in finite fields. The use of fast algorithms of discrete Fourier transform allows to increase the speed of digital signal processing (DSP) due to parallel computing. However, the fast Fourier transform (FFT) has a number of drawbacks. First, is the presence of two computational paths for processing the real and imaginary parts of the signal. Secondly, the use of trigonometric functions as twiddle factors, which leads to rounding errors. To solve this problem through the use of number-theoretic transform of the signal. However, when carrying out orthogonal transformation of signals in finite fields, Galois does not use fast algorithms, fast algorithms similar to Fourier transforms. Therefore, the development of fast algorithm for computing number-theoretic transform is an urgent task.