Barseghyan, Rafayel V . 2021. “About Complexity of FFT Algorithms for Length of Q × 2p”. Mathematical Problems of Computer Science 48 (December):23-32. http://93.187.165.2/index.php/mpcs/article/view/117.