Barseghyan, R. V. . “About Complexity of FFT Algorithms for Length of Q × 2p”. Mathematical Problems of Computer Science, vol. 48, Dec. 2021, pp. 23-32, http://mpcs.sci.am/index.php/mpcs/article/view/117.