# Connexions

You are here: Home » Content » Fast Convolution Using the FFT

### Recently Viewed

This feature requires Javascript to be enabled.

# Fast Convolution Using the FFT

Module by: Robert Nowak. E-mail the author

Summary: This module describes FFT, convolution, filtering, LTI systems, digital filters and circular convolution.

Note: You are viewing an old version of this document. The latest version is available here.

## Important Application of the FFT

### Exercise 1

How many complex multiplies and adds are required to convolute tow N-pt sequences? yn=m=0N1xmhnm y n m 0 N 1 x m h n m

#### Solution

There are 2N1 2 N 1 non-zero output points and each will be computed using NN complex mults and N1 N 1 complex adds. So the total cost = (2N1)(N+N1) 2 N 1 N N 1 ON2 O N 2

• Now zero-pad these two sequences to length 2N1 2 N 1 , take DFTs using the FFT algorithm xnXk x n X k hnHk h n H k The cost is O(2N1)log(2N1)=ONlogN O 2 N 1 2 N 1 O N N
• Multiply DFTs XkHk X k H k The cost is O2N1=ON O 2 N 1 O N
• Inverse DFT using FFT XkHkyn X k H k y n The cost is O(2N1)log(2N1)=ONlogN O 2 N 1 2 N 1 O N N

So the total cost for direct convolution of two N-point sequences is ON2 O N 2 . Total cost for convolution using FFT algorithm is ONlogN O N N . That is a huge savings.

## Summary of DFT

• xn x n is an N-point signal.
• Xk=n=0N1xne(i2πNkn)=n=0N1xn WN kn X k n 0 N 1 x n 2 N k n n 0 N 1 x n WN k n where WN =e(i2πN) WN 2 N is "twiddle factor".
• What is the DFT Xk=XF=kN=n=0N1xne(i2πFn) X k X F k N n 0 N 1 x n 2 F n where XF=kN X F k N is DTFT of xn x n and n=0N1xne(i2πFn) n 0 N 1 x n 2 F n is DTFT of xn x n at digital frequency F. This is a sample of the DTFT. We can do frequency domain analysis on a computer!
• Inverse DFT (IDFT) Xn=1Nn=0N1Xkei2πNkn X n 1 N n 0 N 1 X k 2 N k n
• Build xn x n using "Simple" complex sinusoidal "building block" signals
• Amplitude of each complex sinusoidal building block in xn x n is 1NXk 1 N X k
• Circular Convolution

### DFT

XnhnXk·Hk X n h n · X k H k
(1)
• Regular Convolution from Circular Convolution
• Zero pad xn x n and hn h n to length = length(x) + length(h) - 1
• Zero padding increases frequency resolution in DFT domain
• The Fast Fourier Transform (FFT)
• Efficient computational algorithm for calculating the DFT
• "Divide and conquer"
• Break signal into even and odd samples keep taking shorter and shorter DFTs, then build N-pt DFT by cleverly combining shorter DFTs
• N-pt DFT: ON2ONlog 2 N O N 2 O N 2 N
• Fast Convolution
• Use FFT's to compute circular convolution of zero-padded signals
• Much faster than regular convolution if signal lengths are long
• ON2ONlog 2 N O N 2 O N 2 N

## Content actions

### Give feedback:

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?

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