Skip to main content

The Fourier transform and spectral analysis

  • Chapter
Digital Signal Processing

Abstract

This chapter develops the mathematical relationship behind the discrete Fourier transform (DFT) operation and highlights the limitations of the finite data record on the DFT performance analysis. This is then developed into the classical and modern techniques which are widely used for estimation of the power spectrum from signal sample data records. The power spectral density of a signal was defined previously in section 7.3 via the autocorrelation sequence. Here we extend this to the case of a discretely sampled sequence, x(n) which, in most practical situations, is restricted to a finite and limited number of signal samples.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1999 Bernard Mulgrew, Peter M. Grant and John S. Thompson

About this chapter

Cite this chapter

Mulgrew, B., Grant, P., Thompson, J. (1999). The Fourier transform and spectral analysis. In: Digital Signal Processing. Palgrave, London. https://doi.org/10.1007/978-1-349-14944-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-14944-5_9

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-74531-1

  • Online ISBN: 978-1-349-14944-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics