80 likes | 337 Views
Fast Signal Processing Algorithms. Summary and Requirements. Summary. Time continuous signals and their spectrum; Time discrete signals Relationship to analog signals (sampling) Spectrum: Discrete Time Fourier Transform (DTFT) Discrete Fourier Transform and its relationship to DTFT.
E N D
Fast Signal Processing Algorithms Summary and Requirements
Summary • Time continuous signals and their spectrum; • Time discrete signals • Relationship to analog signals (sampling) • Spectrum: Discrete Time Fourier Transform (DTFT) • Discrete Fourier Transform and its relationship to DTFT
Summary • Fast Fourier Transforms • Derivation of radix 2 Decimation-in-time FFT, radix 2 Decimation-in-frequency FFT, and Radix 4 FFT. Comparison of their efficiency in terms of multiplications required. • Fast Convolution • Relationship between linear and circular convolutions (details) • Overlap-save and overlap add algorithms (details)
Summary • Multirate operations: • Upsampling • Downsampling followed by upsampling • Downsampling • Effects to spectrums • How and when will liaising occur? • Polyphase decomposition • Noble identities
Summary • Polyphase operations • Polyphase decimation • Interpolation • Two-channel filter banks • PRC • QMF filter banks • General form (FIR filters) • Polyphase implementation of analysis and synthesis filter banks
Summary • M-channel filter banks • Tree structure • Octave-band tree structure • Uniform M-channel filter banks • DFT modulated and Cosine modulated filter banks • Wavelet transforms • principles