<< Chapter < Page Chapter >> Page >

Fourier representations

Throughout the course we have been alluding to various Fourier representations. We first recall the appropriate transforms:

  • x ( t ) : continuous-time, finite/periodic on [ - π , π ]
    X [ k ] = 1 2 π - π π x ( t ) e - j k t d t
    x ( t ) = 1 2 π k = - X [ k ] e j k t
  • x [ n ] : infinite, discrete-time
    X ( e j ω ) = 1 2 π n = - x [ n ] e - j ω n
    x [ n ] = 1 2 π - π π X ( e j ω ) e j ω n d ω
  • x [ n ] : finite, discrete-time
    X [ k ] = 1 N n = 0 N - 1 x [ n ] e - j 2 π N k n
    x [ n ] = 1 N k = 0 N - 1 X [ k ] e j 2 π N k n
  • x ( t ) : infinite, continuous-time
    X ( Ω ) = 1 2 π - x ( t ) e - j Ω t d t
    x ( t ) = 1 2 π - X ( Ω ) e j Ω t d Ω

We will think of Fourier representations in two complimentary senses:

  1. “Eigenbasis” representations: Each Fourier transform pair is very naturally related to an appropriate class of LTI systems. In some cases we can think of a Fourier transform asa change of basis.
  2. Unitary operators: While we often use Fourier transforms to analyze certain operators, we can also think of a Fourier transform as itself being an operator.
Various venn diagrams showing the relationship between finite and infinite discrete time, infinite continuous time, DFT, IDFT, CTFS, ICTFS, and others.

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Digital signal processing. OpenStax CNX. Dec 16, 2011 Download for free at http://cnx.org/content/col11172/1.4
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Digital signal processing' conversation and receive update notifications?

Ask