Barseghyan, R. V. . (2021). About Complexity of FFT Algorithms for Length of q × 2p. Mathematical Problems of Computer Science, 48, 23–32. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/117