Barseghyan, R.V. . 2021. About Complexity of FFT Algorithms for Length of q × 2p. Mathematical Problems of Computer Science. 48, (Dec. 2021), 23–32.