Year: 1995
Journal of Computational Mathematics, Vol. 13 (1995), Iss. 4 : pp. 351–356
Abstract
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1995-JCM-9277
Journal of Computational Mathematics, Vol. 13 (1995), Iss. 4 : pp. 351–356
Published online: 1995-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 6