Barseghyan RV . About Complexity of FFT Algorithms for Length of q × 2p. MPCS [Internet]. 2021Dec.10 [cited 2024Sep.28];48:23-32. Available from: http://93.187.165.2/index.php/mpcs/article/view/117