Skip to content Skip to navigation

Connexions

You are here: Home » Content » Running FFT

Navigation

Recently Viewed

This feature requires Javascript to be enabled.

Running FFT

Module by: Douglas L. Jones. E-mail the author

User rating (How does the rating system work?)
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)

Summary: The running FFT efficiently computes DFT samples of successive overlapped blocks of data via a recursive filter implementation.

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.

Some applications need DFT frequencies of the most recent NN samples on an ongoing basis. One example is DTMF, or touch-tone telephone dialing, in which a detection circuit must constantly monitor the line for two simultaneous frequencies indicating that a telephone button is depressed. In such cases, most of the data in each successive block of samples is the same, and it is possible to efficiently update the DFT value from the previous sample to compute that of the current sample. Figure 1 illustrates successive length-4 blocks of data for which successive DFT values may be needed. The running FFT algorithm described here can be used to compute successive DFT values at a cost of only two complex multiplies and additions per DFT frequency.

Figure 1: The running FFT efficiently computes DFT values for successive overlapped blocks of samples.
Figure 1 (image3.png)

The running FFT algorithm is derived by expressing each DFT sample, X n + 1 ω k X n + 1 ω k , for the next block at time n+1 n 1 in terms of the previous value, X n ω k X n ω k , at time nn. X n ω k =∑p=0N−1xn−pⅇ-ⅈ ω k p X n ω k p N 1 0 x n p ω k p X n + 1 ω k =∑p=0N−1xn+1−pⅇ-ⅈ ω k p X n + 1 ω k p N 1 0 x n 1 p ω k p Let q=p−1 q p 1 : X n + 1 ω k =∑q=-1N−2xn−qⅇ-ⅈ ω k q−1=ⅇⅈ ω k ∑q=0N−2xn−qⅇ-ⅈ ω k q+xn+1 X n + 1 ω k q N 2 1 x n q ω k q 1 ω k q N 2 0 x n q ω k q x n 1 Now let's add and subtract ⅇ-ⅈ ω k N−2xn−N+1 ω k N 2 x n N 1 :

X n + 1 ω k =ⅇⅈ ω k ∑q=0N−2xn−qⅇ-ⅈ ω k q+ⅇⅈ ω k xn−(N−1)ⅇ-ⅈ ω k N−1−ⅇ-ⅈ ω k N−2xn−N+1+xn+1=ⅇⅈ ω k ∑q=0N−1xn−qⅇ-ⅈ ω k +xn+1−ⅇ-ⅈ ω k xn−N+1=ⅇⅈ ω k X n ω k +xn+1−ⅇ-ⅈ ω k N−2xn−N+1 X n + 1 ω k ω k q N 2 0 x n q ω k q ω k x n N 1 ω k N 1 ω k N 2 x n N 1 x n 1 ω k q N 1 0 x n q ω k x n 1 ω k x n N 1 ω k X n ω k x n 1 ω k N 2 x n N 1 (1)
This running FFT algorithm requires only two complex multiplies and adds per update, rather than N if each DFT value were recomputed according to the DFT equation. Another advantage of this algorithm is that it works for any ω k ω k , rather than just the standard DFT frequencies. This can make it advantageous for applications, such as DTMF detection, where only a few arbitrary frequencies are needed.

Successive computation of a specific DFT frequency for overlapped blocks can also be thought of as a length-NN FIR filter. The running FFT is an efficient recursive implementation of this filter for this special case. Figure 2 shows a block diagram of the running FFT algorithm. The running FFT is one way to compute DFT filterbanks. If a window other than rectangular is desired, a running FFT requires either a fast recursive implementation of the corresponding windowed, modulated impulse response, or it must have few non-zero coefficients so that it can be applied after the running FFT update via frequency-domain convolution. DFT-symmmetric raised-cosine windows are an example.

Figure 2: Block diagram of the running FFT computation, implemented as a recursive filter
Figure 2 (image4.png)

Content actions

Give Feedback:

E-mail the module author | Rate 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)

Download:

Module PDF

Add module to:

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 (?)

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