Description
Discrete and Continuous Fourier Transforms
Analysis, Applications and Fast Algorithms
Author: Chu Eleanor
Language: EnglishSubjects for Discrete and Continuous Fourier Transforms:
Keywords
FFT Algorithm; Cyclic Convolution; Window Functions; De Ned; Fourier Series; Poisson Sum; Digital Filtering; Periodic Convolution; Discrete Convolution; Fourier Transform Pairs; Fast Algorithms; Impulse Train; Nyquist Sampling Rate; DFT Result; fast Fourier transform algorithms; Radix-2 FFT; discrete Fourier transform; Linear Convolution; digital signal processing; Twiddle Factor; continuous Fourier transform; Frequency Domain Plot; computing applications; Cosine Modes; Sampling Theorem; Discrete Time Sample; Band Limited Signal; Fourier Series Representation; Fourier Series Expansion; Rectangular Pulse Function; DFT Matrix; Short Transforms; Continuous Convolution; Kronecker Product; Nyquist Interval
Publication date: 12-2019
· 17.8x25.4 cm · Paperback
Publication date: 04-2008
424 p. · 17.8x25.4 cm · Hardback
Description
/li>Contents
/li>Readership
/li>Biography
/li>Comment
/li>
Long employed in electrical engineering, the discrete Fourier transform (DFT) is now applied in a range of fields through the use of digital computers and fast Fourier transform (FFT) algorithms. But to correctly interpret DFT results, it is essential to understand the core and tools of Fourier analysis. Discrete and Continuous Fourier Transforms: Analysis, Applications and Fast Algorithms presents the fundamentals of Fourier analysis and their deployment in signal processing using DFT and FFT algorithms.
This accessible, self-contained book provides meaningful interpretations of essential formulas in the context of applications, building a solid foundation for the application of Fourier analysis in the many diverging and continuously evolving areas in digital signal processing enterprises. It comprehensively covers the DFT of windowed sequences, various discrete convolution algorithms and their applications in digital filtering and filters, and many FFT algorithms unified under the frameworks of mixed-radix FFTs and prime factor FFTs. A large number of graphical illustrations and worked examples help explain the concepts and relationships from the very beginning of the text.
Requiring no prior knowledge of Fourier analysis or signal processing, this book supplies the basis for using FFT algorithms to compute the DFT in a variety of application areas.