Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

1.1 The mathematician’s perspective
1.2 Prerequisite mathematics
1.3 Operation counts of the algorithms
1.4 Multipoint polynomial evaluation
1.5 Fast multipoint evaluation
Algorithm : Fast multipoint evaluation (recursive implementation)
Figure 1.2 Pseudocode for fast multipoint evaluation (recursive implementation)
1.6 Lagrangian interpolation
1.7 Fast interpolation
Figure 1.4 Pseudocode for fast interpolation (recursive implementation)
1.8 Concluding remarks
MULTIPLICATIVE FAST FOURIER TRANSFORM ALGORITHMS
2.1 The bit reversal function
2.10 The ternary reversal function
2.14 Radix-3 FFT for symbolic roots of unity
2.15 Concluding remarks
3.1 Von zur Gathen-Gerhard additive FFT
3.6 Concluding remarks
INVERSE FAST FOURIER TRANSFORM ALGORITHMS
4.3 Other multiplicative IFFTs
4.6 Concluding remarks
POLYNOMIAL MULTIPLICATION ALGORITHMS
5.1 Karatsuba multiplication
5.2 Karatsuba’s algorithm for other sizes
5.3 FFT-based multiplication
5.4 Sch¨onhage’s algorithm
5.5 FFT-based multiplication using the new additive FFT algorithm
5.6 Comparison of the multiplication algorithms
5.7 Concluding remarks
TRUNCATED FAST FOURIER TRANSFORM ALGORITHMS
6.1 A truncated FFT algorithm
6.2 An inverse truncated FFT algorithm
6.3 Illustration of truncated FFT algorithms
6.6 Concluding remarks
POLYNOMIAL DIVISION WITH REMAINDER
7.1 Classical division
7.2 Newton division
7.3 Newton divison using the multiplicative FFT
7.4 Newton divison for ﬁnite ﬁelds of characteristic 2
7.5 Concluding remarks
THE EUCLIDEAN ALGORITHM
8.1 The Euclidean Algorithm
8.2 The Extended Euclidean Algorithm
8.3 Normalized Extended Euclidean Algorithm
8.4 The Fast Euclidean Algorithm
8.5 Algorithm improvements due to the Fast Fourier Transform
8.6 Concluding remarks
REED-SOLOMON ERROR-CORRECTING CODES
9.1 Systematic encoding of Reed-Solomon codewords
9.2 A transform of the Reed-Solomon codeword
9.3 Decoding of systematic Reed-Solomon codewords
9.4 Pseudocode and operation count of the simple decoding algorithm
9.5 Concluding remarks
FURTHER APPLICATIONS AND CONCLUDING REMARKS
10.1 Computing the coeﬃcients of a discrete Fourier series
10.2 Fast multipoint evaluation: revisited
10.3 Fast interpolation: revisited
10.4 Other research areas involving FFT algorithms
10.5 Concluding remarks
Master equations for algorithm operation counts
Algorithm : Modiﬁed split-radix FFT (version A reduction step)
Algorithm : Modiﬁed split-radix FFT (version B reduction step)
Figure C.3 Pseudocode for modiﬁed split-radix FFT (version C reduction step)
Figure C.4 Pseudocode for modiﬁed split-radix FFT (version D reduction step)
Complex conjugate properties
Proof of the existence of the Cantor basis
Taylor shift of a polynomial with ﬁnite ﬁeld coeﬃcients
Taylor expansion of a polynomial with ﬁnite ﬁeld coeﬃcients at xτ
Operation count: Karatsuba’s multiplication algorithm
Operation count: Sch¨onhage’s algorithm
0 of .
Results for:
P. 1
FAST FOURIER TRANSFORM ALGORITHMS WITH APPLICATIONS

# FAST FOURIER TRANSFORM ALGORITHMS WITH APPLICATIONS

Ratings: (0)|Views: 485|Likes:

### Availability:

See more
See less

07/26/2011

pdf

text

original

Pages 7 to 39 are not shown in this preview.
Pages 47 to 138 are not shown in this preview.