TY - JOUR
T1 - The Multiplicative Complexity and Algorithm of the Generalized Discrete Fourier Transform (GFT)
JO - Journal of Computational Mathematics
VL - 4
SP - 351
EP - 356
PY - 1995
DA - 1995/08
SN - 13
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/9277.html
KW - 
AB - <p style="text-align: justify;">In this paper, we have proved that the lower bound of the number of real multiplications for computing a length $2^{t}$ real GFT(a,b) $(a=\pm 1/2,b=0\ or\ b=\pm 1/2,a=0)$ is $2^{t+1}-2t-2$ and that for computing a length $2^{t}$ real GFT(a,b)$(a=\pm 1/2, b=\pm 1/2)$ is $2^{t+1}-2$. Practical algorithms which meet the lower bounds of multiplications are given.</p>