Fast Transforms Algorithms, Analyses, ApplicationsThis book has grown from notes used by the authors to instruct fast transform classes. One class was sponsored by the Training Department of Rockwell International, and another was sponsored by the Department of Electrical Engineering of The University of Texas at Arlington. Some of the material was also used in a short course sponsored by the University of Southern California. The authors are indebted to their students for motivating the writing of this book and for suggestions to improve it. |
Other editions - View all
Fast Transforms Algorithms, Analyses, Applications Douglas F. Elliott,K. Ramamohan Rao Limited preview - 1983 |
Common terms and phrases
additions bandwidth basis functions Chapter circular convolution circular shift complex computation data sequence decimation defined delta functions demodulator developed DFT coefficients DFT matrix DFT output digital filter dyadic entry Equation evaluation example fast algorithms fast transform FIR filter Fourier series Fourier transform frequency domain frequency response gives IEEE Trans implementation input integer inverse K. R. Rao k₁ k₂ Kronecker product m₁ magnitude mainlobe matrix factors matrix of exponents modulo N-point DFT N₁ N₂ noise nonperiodic octave periodic polynomial transforms power spectrum prime number Problem proportional filters recursive reduced representation respectively sampling Section sequence number shaped DFT filter Show shown in Fig sidelobe Signal flowgraph Signal Process sinusoids sparse matrix Speech Signal Process Table theorem transform sequence twiddle factors values vector W⁰ Walsh functions window zero