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