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 January 9, 2025. http://mpcs.sci.am/index.php/mpcs/article/view/117.