Skip to content Skip to navigation Skip to collection information

OpenStax_CNX

You are here: Home » Content » Discrete-Time Fourier Analysis » Discrete Fourier Transform (DFT)

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: "Fundamentals of Electrical Engineering I"

    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 DSS - Braille display tagshide tags

    This module is included inLens: Rice University Disability Support Services's Lens
    By: Rice University Disability Support ServicesAs a part of collection: "Fundamentals of Electrical Engineering I"

    Comments:

    "Electrical Engineering Digital Processing Systems in Braille."

    Click the "Rice DSS - Braille" 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 collection is included in aLens by: Digital Scholarship at Rice University

    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.

  • Bookshare

    This module is included inLens: Bookshare's Lens
    By: Bookshare - A Benetech InitiativeAs a part of collection: "Fundamentals of Electrical Engineering I"

    Comments:

    "Accessible versions of this collection are available at Bookshare. DAISY and BRF provided."

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

  • Featured Content display tagshide tags

    This module is included inLens: Connexions Featured Content
    By: ConnexionsAs a part of collection: "Fundamentals of Electrical Engineering I"

    Comments:

    "The course focuses on the creation, manipulation, transmission, and reception of information by electronic means. It covers elementary signal theory, time- and frequency-domain analysis, the […]"

    Click the "Featured Content" 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 and collection are included inLens: Lens for Engineering
    By: Sidney Burrus

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

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 Fourier Transform (DFT)

Module by: Don Johnson. E-mail the author

Summary: The Fourier transform can be computed in discrete-time despite the complications caused by a finite signal and continuous frequency.

The discrete-time Fourier transform (and the continuous-time transform as well) can be evaluated when we have an analytic expression for the signal. Suppose we just have a signal, such as the speech signal used in the previous chapter, for which there is no formula. How then would you compute the spectrum? For example, how did we compute a spectrogram such as the one shown in the speech signal example? The Discrete Fourier Transform (DFT) allows the computation of spectra from discrete-time data. While in discrete-time we can exactly calculate spectra, for analog signals no similar exact spectrum computation exists. For analog-signal spectra, use must build special devices, which turn out in most cases to consist of A/D converters and discrete-time computations. Certainly discrete-time spectral analysis is more flexible than continuous-time spectral analysis.

The formula for the DTFT is a sum, which conceptually can be easily computed save for two issues.

  • Signal duration. The sum extends over the signal's duration, which must be finite to compute the signal's spectrum. It is exceedingly difficult to store an infinite-length signal in any case, so we'll assume that the signal extends over 0 N1 0 N 1 .
  • Continuous frequency. Subtler than the signal duration issue is the fact that the frequency variable is continuous: It may only need to span one period, like 12 12 1 2 1 2 or 0 1 0 1 , but the DTFT formula as it stands requires evaluating the spectra at all frequencies within a period. Let's compute the spectrum at a few frequencies; the most obvious ones are the equally spaced ones f=kK f k K , k0K1 k 0 K 1 .

We thus define the discrete Fourier transform (DFT) to be

k ,k0K1:Sk= n =0N1snei2πnkK k k 0 K 1 S k n 0 N 1 s n 2 n k K
(1)
Here, Sk S k is shorthand for Sei2πkK S 2 k K .

We can compute the spectrum at as many equally spaced frequencies as we like. Note that you can think about this computationally motivated choice as sampling the spectrum; more about this interpretation later. The issue now is how many frequencies are enough to capture how the spectrum changes with frequency. One way of answering this question is determining an inverse discrete Fourier transform formula: given Sk S k , k=0K1 k 0 K 1 how do we find sn s n , n=0N1 n 0 N 1 ? Presumably, the formula will be of the form sn= k =0K1Skei2πnkK s n k 0 K 1 S k 2 n k K . Substituting the DFT formula in this prototype inverse transform yields

sn= k =0K1 m =0N1sme(i2πmkK)ei2πnkK s n k 0 K 1 m 0 N 1 s m 2 m k K 2 n k K
(2)
Note that the orthogonality relation we use so often has a different character now.
k =0K1e(i2πkmK)ei2πknK={K  if  (m=nn±Kn±2K)0  otherwise   k 0 K 1 2 k m K 2 k n K K m n ± n K ± n 2 K 0
(3)
We obtain nonzero value whenever the two indices differ by multiples of KK. We can express this result as KlδmnlK K l l δ m n l K . Thus, our formula becomes
sn= m =0N1smK l =δmnlK s n m 0 N 1 s m K l δ m n l K
(4)
The integers nn and mm both range over 0N1 0 N 1 . To have an inverse transform, we need the sum to be a single unit sample for m m, n n in this range. If it did not, then sn s n would equal a sum of values, and we would not have a valid transform: Once going into the frequency domain, we could not get back unambiguously! Clearly, the term l=0 l 0 always provides a unit sample (we'll take care of the factor of K K soon). If we evaluate the spectrum at fewer frequencies than the signal's duration, the term corresponding to m=n+K m n K will also appear for some values of m m, n=0N1 n 0 N 1 . This situation means that our prototype transform equals sn+sn+K s n s n K for some values of n n. The only way to eliminate this problem is to require KN K N : We must have at least as many frequency samples as the signal's duration. In this way, we can return from the frequency domain we entered via the DFT.

Exercise 1

When we have fewer frequency samples than the signal's duration, some discrete-time signal values equal the sum of the original signal values. Given the sampling interpretation of the spectrum, characterize this effect a different way.

Solution

This situation amounts to aliasing in the time-domain.

Another way to understand this requirement is to use the theory of linear equations. If we write out the expression for the DFT as a set of linear equations,

s0+s1++sN1=S0 s 0 s 1 s N 1 S 0
(5)
s0+s1e(i)2πK++sN1e(i)2π(N1)K=S1 s 0 s 1 2 K s N 1 2 N 1 K S 1 s0+s1e(i)2π(K1)K++sN1e(i)2π(N1)(K1)K=SK1 s 0 s 1 2 K 1 K s N 1 2 N 1 K 1 K S K 1 we have K K equations in N N unknowns if we want to find the signal from its sampled spectrum. This requirement is impossible to fulfill if K<N K N ; we must have KN K N . Our orthogonality relation essentially says that if we have a sufficient number of equations (frequency samples), the resulting set of equations can indeed be solved.

By convention, the number of DFT frequency values K K is chosen to equal the signal's duration N N. The discrete Fourier transform pair consists of

Discrete Fourier Transform Pair

Sk= n =0N1sne(i2πnkN) sn=1N k =0N1Skei2πnkN S k n 0 N 1 s n 2 n k N s n 1 N k 0 N 1 S k 2 n k N
(6)

Example 1

Use this demonstration to perform DFT analysis of a signal.

Download LabVIEW Source

Example 2

Use this demonstration to synthesize a signal from a DFT sequence.

LabVIEW Example: (run) (source)

Collection Navigation

Content actions

Download:

Collection as:

PDF | EPUB (?)

What is an EPUB file?

EPUB is an electronic book format that can be read on a variety of mobile devices.

Downloading to a reading device

For detailed instructions on how to download this content's EPUB to your specific device, click the "(?)" link.

| More downloads ...

Module as:

PDF | EPUB (?)

What is an EPUB file?

EPUB is an electronic book format that can be read on a variety of mobile devices.

Downloading to a reading device

For detailed instructions on how to download this content's EPUB to your specific device, click the "(?)" link.

| More downloads ...

Add:

Collection 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

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