Skip to content Skip to navigation

Connexions

You are here: Home » Content » Discrete Time Convolution and the DTFT

Navigation

Lenses

What is a lens?

Definition of a lens

Lenses

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

What is in a lens?

Lens makers point to 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 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.

This content is ...

Affiliated with (What does "Affiliated with" mean?)

This content is either by members of the organizations listed or about topics related to the organizations listed. Click each link to see a list of all content affiliated with the organization.
  • OrangeGrove display tagshide tags

    This module is included inLens: Florida Orange Grove Textbooks
    By: Florida Orange GroveAs a part of collection: "Signals and Systems"

    Click the "OrangeGrove" link to see all content affiliated with them.

    Click the tag icon tag icon to display tags associated with this content.

  • Rice Digital Scholarship display tagshide tags

    This module is included in aLens by: Digital Scholarship at Rice UniversityAs a part of collection: "Signals and Systems"

    Click the "Rice Digital Scholarship" link to see all content affiliated with them.

    Click the tag icon tag icon to display tags associated with this content.

Also in these lenses

  • Lens for Engineering

    This module is included inLens: Lens for Engineering
    By: Sidney BurrusAs a part of collection: "Signals and Systems"

    Click the "Lens for Engineering" link to see all content selected in this lens.

  • richb's DSP display tagshide tags

    This module is included inLens: richb's DSP resources
    By: Richard BaraniukAs a part of collection: "Signals and Systems"

    Comments:

    "My introduction to signal processing course at Rice University."

    Click the "richb's DSP" link to see all content selected in this lens.

    Click the tag icon tag icon to display tags associated with this content.

Recently Viewed

This feature requires Javascript to be enabled.

Tags

(What is a tag?)

These tags come from the endorsement, affiliation, and other lenses that include this content.
 

Discrete Time Convolution and the DTFT

Module by: Stephen Kruzick, Dan Calderon. E-mail the authors

Summary: This module describes the relationship between discrete convolution and the DTFT.

Introduction

This module discusses convolution of discrete signals in the time and frequency domains.

The Discrete-Time Convolution

Discrete Time Fourier Transform

The DTFT transforms an infinite-length discrete signal in the time domain into an finite-length (or 2⁢π 2 -periodic) continuous signal in the frequency domain.

DTFT

X⁢ω=∑ n =−∞∞x⁢n⁢e−(j⁢ω⁢n) X ω n x n j ω n
(1)

Inverse DTFT

x⁢n=12⁢π⁢∫02⁢πX⁢ω⁢ej⁢ω⁢nd ω x n 1 2 ω 0 2 X ω j ω n
(2)

Demonstration

Figure 1: Interact (when online) with a Mathematica CDF demonstrating the Discrete Convolution. To Download, right-click and save as .cdf.
DiscreteConvolutionDemo

Convolution Sum

As mentioned above, the convolution sum provides a concise, mathematical way to express the output of an LTI system based on an arbitrary discrete-time input signal and the system's impulse response. The convolution sum is expressed as

y⁢n=∑ k =−∞∞x⁢k⁢h⁢n−k y n k x k h n k
(3)
As with continuous-time, convolution is represented by the symbol *, and can be written as
y⁢n=x⁢n*h⁢n y n x n h n
(4)
Convolution is commutative. For more information on the characteristics of convolution, read about the Properties of Convolution.

Convolution Theorem

Let ff and gg be two functions with convolution f*gf*g.. Let FF be the Fourier transform operator. Then

F ( f * g ) = F ( f ) · F ( g ) F ( f * g ) = F ( f ) · F ( g )
(5)
F ( f · g ) = F ( f ) * F ( g ) F ( f · g ) = F ( f ) * F ( g )
(6)

By applying the inverse Fourier transform F-1F-1, we can write:

f * g = F - 1 ( F ( f ) · F ( g ) ) f * g = F - 1 ( F ( f ) · F ( g ) )
(7)

Conclusion

The Fourier transform of a convolution is the pointwise product of Fourier transforms. In other words, convolution in one domain (e.g., time domain) corresponds to point-wise multiplication in the other domain (e.g., frequency domain).

Content actions

Download module as:

PDF | More downloads ...

Add module to:

My Favorites (?)

'My Favorites' is a special kind of lens which you can use to bookmark modules and collections. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need an account to use 'My Favorites'.

| A lens I own (?)

Definition of a lens

Lenses

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

What is in a lens?

Lens makers point to 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 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