Abstract
The Discrete Fourier Transform (DFT) is of central importance in Digital Signal Processing. When implemented using a Fast Fourier Transform (FFT) algorithm, it offers rapid frequency-domain analysis and processing of digital signals, and investigation of digital systems. The development of FFT algorithms from the mid-1960s onwards gave a huge impetus to DSP, making practicable a range of valuable techniques.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© 1992 Paul A. Lynn
About this chapter
Cite this chapter
Lynn, P.A. (1992). The Discrete and Fast Fourier Transforms. In: Digital Signals, Processors and Noise. Macmillan New Electronics Series. Palgrave, London. https://doi.org/10.1007/978-1-349-22145-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-349-22145-5_3
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-54587-4
Online ISBN: 978-1-349-22145-5
eBook Packages: EngineeringEngineering (R0)