Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword or section
Like this
4Activity

Table Of Contents

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.2 Classical radix-2 FFT
2.3 Twisted radix-2 FFT
2.4 Hybrid radix-2 FFTs
2.5 Classical radix-4 FFT
2.6 Twisted radix-4 FFT
2.7 Radix-8 FFT
2.8 Split-radix FFT
2.9 Modified split-radix FFT
2.10 The ternary reversal function
2.11 Classical radix-3 FFT
2.12 Twisted radix-3 FFT
2.13 Hybrid radix-3 FFTs
2.14 Radix-3 FFT for symbolic roots of unity
2.15 Concluding remarks
ADDITIVE FAST FOURIER TRANSFORM ALGORITHMS
3.1 Von zur Gathen-Gerhard additive FFT
3.2 Wang-Zhu-Cantor additive FFT
3.3 Shifted additive FFT
3.4 Gao’s additive FFT
3.5 A new additive FFT
3.6 Concluding remarks
INVERSE FAST FOURIER TRANSFORM ALGORITHMS
4.1 Classical radix-2 IFFT
4.2 Twisted radix-2 IFFT
4.3 Other multiplicative IFFTs
4.5 A new additive IFFT
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 finite fields 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 coefficients 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
Operation count: split-radix FFT
Additional details of the modified split-radix FFT
Algorithm : Modified split-radix FFT (version A reduction step)
Algorithm : Modified split-radix FFT (version B reduction step)
Figure C.3 Pseudocode for modified split-radix FFT (version C reduction step)
Figure C.4 Pseudocode for modified split-radix FFT (version D reduction step)
Complex conjugate properties
Proof of the existence of the Cantor basis
Taylor shift of a polynomial with finite field coefficients
Taylor expansion of a polynomial with finite field coefficients at xτ
Additional recurrence relation solutions for additive FFT algorithms
Operation count: Karatsuba’s multiplication algorithm
Operation count: Sch¨onhage’s algorithm
0 of .
Results for:
No results containing your search query
P. 1
FAST FOURIER TRANSFORM ALGORITHMS WITH APPLICATIONS

FAST FOURIER TRANSFORM ALGORITHMS WITH APPLICATIONS

Ratings: (0)|Views: 485|Likes:
Published by ma860930

More info:

Published by: ma860930 on Mar 25, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

07/26/2011

pdf

text

original

You're Reading a Free Preview
Pages 7 to 39 are not shown in this preview.
You're Reading a Free Preview
Pages 47 to 138 are not shown in this preview.
You're Reading a Free Preview
Pages 145 to 253 are not shown in this preview.
You're Reading a Free Preview
Pages 260 to 340 are not shown in this preview.

Activity (4)

You've already reviewed this. Edit your review.
1 thousand reads
1 hundred reads
notanyoneatall liked this
dave_765 liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->