[1]
R. V. . Barseghyan, “About Complexity of FFT Algorithms for Length of q × 2p”, MPCS, vol. 48, pp. 23–32, Dec. 2021.