|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-Reports 1990 | Copyright 1990 Universität Bonn, Institut für Informatik, Abt. V | |
|
8550 20.11.2008 |
Improved Upper Complexity Bounds for the Discrete Fourier Transform
Ulrich Baum, Michael Clausen, Benno Tietz [Download PostScript] [Download PDF] The linear complexity LS(G) of a finite Group G is the minimal number of additions, subtractions and multiplications needed to evaluate a suitable Fourier transform of CG. Combining and modifying several classical FFT-algorithms, we show that LS ≤ 8|G| log2|G| for any finite abelian group G. |
|
|
Last Change:
11/20/08 at 14:18:14
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |