<< Chapter < Page Chapter >> Page >

The discrete-time fourier transform

The (non-normalized) DTFT is simply a special case of the z -transform for the case z = 1 , i.e., z = e j ω for some value ω [ - π , π ]

X ( e j ω ) = n = - x [ n ] e - j ω n .

The picture you should have in mind is the complex plane. The z -transform is defined on the whole plane, and the DTFT is simply the value of the z -transform on the unit circle, as illustrated below.

Graph with horizontal axis Re[z] and vertical axis Im[z]. There is a large blue circle centered at the origin on the graph, with a line segment from the origin to a point on the circle in the first quadrant. The acute angle that the line segment makes measured down to the horizontal axis is labeled ω. The point where the line segment intersects the circle is labeled e^j ω.

This picture should make it clear why the DTFT is defined only for ω [ - π , π ] (or why it is periodic). Using the normalization above, we also have the inverse DTFT formula:

x [ n ] = 1 2 π - π π X ( e j ω ) e j ω n d ω .

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