Skip to content Skip to navigation

Connexions

You are here: Home » Content » m13 - Properties of the DTFT

Navigation

Content Actions
  • Download module PDF
  • Add to ...
    Add the module to:
    • My Favorites
    • A lens
    • An external social bookmarking service
    • My Favorites (What is 'My Favorites'?)
      'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.
    • A lens (What is a lens?)

      Definition of a lens

      Lenses

      A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

      What is in a lens?

      Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

      Who can create a lens?

      Any individual Connexions member, a community, or a respected organization.

      What are tags? tag icon

      Tags are descriptors added by lens makers to help label content, attaching a vocabulary that is meaningful in the context of the lens.

    • External bookmarks
  • E-mail the author
  • Rate this module (How does the rating system work?)

    Rating system

    Ratings

    Ratings allow you to judge the quality of modules. If other users have ranked the module then its average rating is displayed below. Ratings are calculated on a scale from one star (Poor) to five stars (Excellent).

    How to rate a module

    Hover over the star that corresponds to the rating you wish to assign. Click on the star to add your rating. Your rating should be based on the quality of the content. You must have an account and be logged in to rate content.

    		(0 ratings)

Recently Viewed

This feature requires Javascript to be enabled.

m13 - Properties of the DTFT

Module by: C. Sidney Burrus

Summary: The properties of the DTFT are very similar to those of the DFT and other Fourier transforms.

Note: Your browser may not currently support MathML. See our browser support page for additional details. You can always view the correct math in the PDF version.

Properties

The properties of the DTFT are similar to those for the DFT and are important in the analysis and interpretation of long signals. The main properties are given here using the notation that the DTFT of a complex sequence x ( n ) x ( n ) is ℱ { x ( n ) } = X ( ω ) ℱ { x ( n ) } = X ( ω ) .

  1. Linear Operator: ℱ { x + y } = ℱ { x } + ℱ { y } ℱ { x + y } = ℱ { x } + ℱ { y }
  2. Periodic Spectrum: X ( ω ) = X ( ω + 2 π ) X ( ω ) = X ( ω + 2 π )
  3. Properties of Even and Odd Parts: x ( n ) = u ( n ) + j v ( n ) x ( n ) = u ( n ) + j v ( n ) and X ( ω ) = A ( ω ) + j B ( ω ) X ( ω ) = A ( ω ) + j B ( ω ) u u v v A A B B | X | | X | θ θ even 0 even 0 even 0 odd 0 0 odd even 0 0 even 0 even even π / 2 π / 2 0 odd odd 0 even π / 2 π / 2
  4. Convolution: If non-cyclic or linear convolution is defined by: y ( n ) = h ( n ) * x ( n ) = ∑ m = − ∞ ∞ h ( n − m ) x ( m ) = ∑ k = − ∞ ∞ h ( k ) x ( n − k ) y ( n ) = h ( n ) * x ( n ) = ∑ m = − ∞ ∞ h ( n − m ) x ( m ) = ∑ k = − ∞ ∞ h ( k ) x ( n − k ) then ℱ { h ( n ) * x ( n ) } = ℱ { h ( n ) } ℱ { x ( n ) } ℱ { h ( n ) * x ( n ) } = ℱ { h ( n ) } ℱ { x ( n ) }
  5. Multiplication: If cyclic convolution is defined by: Y ( ω ) = H ( ω ) ∘ X ( ω ) = ∫ 0 T H ˜ ( ω − Ω ) X ˜ ( Ω ) ⅆ Ω Y ( ω ) = H ( ω ) ∘ X ( ω ) = ∫ 0 T H ˜ ( ω − Ω ) X ˜ ( Ω ) ⅆ Ω ℱ { h ( n ) x ( n ) } = 1 2 π ℱ { h ( n ) } ∘ ℱ { x ( n ) } ℱ { h ( n ) x ( n ) } = 1 2 π ℱ { h ( n ) } ∘ ℱ { x ( n ) }
  6. Parseval: ∑ n = − ∞ ∞ | x ( n ) | 2 = 1 2 π ∫ − π π | X ( ω ) | 2 ⅆ ω ∑ n = − ∞ ∞ | x ( n ) | 2 = 1 2 π ∫ − π π | X ( ω ) | 2 ⅆ ω
  7. Shift: ℱ { x ( n − M ) } = X ( ω ) e − j ω M ℱ { x ( n − M ) } = X ( ω ) e − j ω M
  8. Modulate: ℱ { x ( n ) e j ω 0 n } = X ( ω − ω 0 ) ℱ { x ( n ) e j ω 0 n } = X ( ω − ω 0 )
  9. Sample: ℱ { x ( K n ) } = 1 K ∑ m = 0 K − 1 X ( ω + L m ) ℱ { x ( K n ) } = 1 K ∑ m = 0 K − 1 X ( ω + L m ) where N = L K N = L K
  10. Stretch: ℱ { x s ( n ) } = X ( ω ) ℱ { x s ( n ) } = X ( ω ) , for − K π ≤ ω ≤ K π − K π ≤ ω ≤ K π where x s ( K n ) = x ( n ) x s ( K n ) = x ( n ) for integer n n and zero otherwise.
  11. Orthogonality: ∑ n = − ∞ ∞ e − j ω 1 n e − j ω 2 n = 2 π δ ( ω 1 − ω 2 ) ∑ n = − ∞ ∞ e − j ω 1 n e − j ω 2 n = 2 π δ ( ω 1 − ω 2 )

Comments, questions, feedback, criticisms?

Send feedback