Some perspectives have evolved that allow classical filtering operations to be implemented by the FFT. The DFT gives access to the computational efficiency of the FFT. Two basic filtering tasks can be performed with DFT: (1) convolution or correlation between two arbitrary arrays and (2) narrowband channelization. This chapter describes some signal processing applications that use the DFT to perform specific time domain filtering tasks. These systems can perform general time domain signal processing and classical frequency domain processing. The discrete Fourier transform (DFT), implemented by one of the computationally efficient fast Fourier transform (FFT) algorithms, has become the core of many digital signal processing systems. HARRIS, in Handbook of Digital Signal Processing, 1987 Publisher Summary
0 kommentar(er)
