Loading [MathJax]/jax/output/CommonHTML/jax.js
Journals
Resources
About Us
Open Access

The Multiplicative Complexity and Algorithm of the Generalized Discrete Fourier Transform (GFT)

The Multiplicative Complexity and Algorithm of the Generalized Discrete Fourier Transform (GFT)

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 2t real GFT(a,b) (a=±1/2,b=0 or b=±1/2,a=0) is 2t+12t2 and that for computing a length 2t real GFT(a,b)(a=±1/2,b=±1/2) is 2t+12. 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

Keywords: