Fast Fourier Transforms by C. Sidney Burrus, Matteo Frigo, Steven G. Johnson, - HTML preview

/ Home / Engineering / Fast Fourier Transforms
PLEASE NOTE: This is an HTML preview only and some elements such as links or page numbers may be incorrect.
Download the book in PDF, ePub, Kindle for a complete version.
PREV   NEXT

Index

B

bit-reversal, Review of the Cooley-Tukey FFT
blocking, Understanding FFTs with an ideal cache
butterfly, Review of the Cooley-Tukey FFT

C

cache aware, Understanding FFTs with an ideal cache
cache complexity, Understanding FFTs with an ideal cache
cache hit, Understanding FFTs with an ideal cache
cache line, Understanding FFTs with an ideal cache
cache miss, Understanding FFTs with an ideal cache
cache-oblivious, Understanding FFTs with an ideal cache
cascade summation, Numerical Accuracy in FFTs
codelets, Generating Small FFT Kernels
creation, Generating Small FFT Kernels

D

dag, Generating Small FFT Kernels
decimation in frequency, Review of the Cooley-Tukey FFT
decimation in time, Review of the Cooley-Tukey FFT, Cooley-Tukey plans
dft problem, The problem to be solved
dif, Review of the Cooley-Tukey FFT
dit, Review of the Cooley-Tukey FFT, Cooley-Tukey plans
dynamic programming, The FFTW planner

E

estimate mode, The FFTW planner

F

four-step, Review of the Cooley-Tukey FFT

G

genfft, Generating Small FFT Kernels

I

i/o dimension, The problem to be solved
i/o tensor, The problem to be solved
ideal cache, Understanding FFTs with an ideal cache
in-place, The problem to be solved
input pointer, The problem to be solved
input stride, The problem to be solved

L

large radices, Understanding FFTs with an ideal cache
length, The problem to be solved
linear network, Generating Small FFT Kernels

M

mixed radix, Review of the Cooley-Tukey FFT

N

network transposition, Generating Small FFT Kernels

O

optimal, Understanding FFTs with an ideal cache
optimal cache-oblivious, Understanding FFTs with an ideal cache
output pointer, The problem to be solved
output stride, The problem to be solved

P

plan, Adaptive Composition of FFT Algorithms
planner, Adaptive Composition of FFT Algorithms
pointers, The problem to be solved
problems, Adaptive Composition of FFT Algorithms

R

radix, Review of the Cooley-Tukey FFT, Cooley-Tukey plans
rank, The problem to be solved
row-major, DFT problem examples

S

schedule, Generating Small FFT Kernels
scheduling, Generating Small FFT Kernels
simplification, Generating Small FFT Kernels
six-step, Review of the Cooley-Tukey FFT
split radix, Review of the Cooley-Tukey FFT

T

tall, Understanding FFTs with an ideal cache
temporal locality, FFTs and the Memory Hierarchy
transpose, DFT problem examples
twiddle factors, Review of the Cooley-Tukey FFT
PREV   NEXT