Skip to content Skip to navigation

Connexions

You are here: Home » Content » DWT Implementation using FFTs

Navigation

Recently Viewed

This feature requires Javascript to be enabled.

DWT Implementation using FFTs

Module by: Phil Schniter. 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)

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.

Finally, we say a few words about DWT implementation. Here we focus on a single DWT stage and assume circular convolution, yielding an MMxMM DWT matrix T M T M . In the general case, MMxMM matrix multiplication requires M2 M 2 multiplications. The DWT matrices, however, have a circular-convolution structure which allows us to implement them using significantly less multiplies. Below we present some simple and reasonably efficient approaches for the implementation of T M T M and T M T T M .

We treat the inverse DWT first. Recall that in the lowpass synthesis branch, we upsample the input before circularly convolving with Hz H z . Denoting the upsampled coefficient sequence by an a n , fast circular convolution an*hn a n h n can be described as follows (using Matlab notation) 


	ifft( fft(a).*fft(h,length(a)) )

where we have assumed that length(a) ≥ length(h). 1 The highpass branch is handled similarly using Gz G z , after which the two branch outputs are summed.

Next we treat the forward DWT. Recall that in the lowpass analysis branch, we circularly convolve the input with Hz-1 H z and then downsample the result. The fast circular convolution an*h-n a n h n can be implemented using 


	wshift('1', ifft(fft(a).*fft(flipud(h),length(a))), length(h)-1 )

where wshift accomplishes a circular shift of the ifft output that makes up for the unwanted delay of length(h)-1 samples imposed by the flipud operation. The highpass branch is handled similarly but with filter Gz-1 G z . Finally, each branch is downsampled by factor two.

We note that the proposed approach is not totally efficient because downsampling is performed after circular convolution (and upsampling before circular convolution). Still, we have outlined this approach because it is easy to understand and still results in major saving when MM is large: it converts the OM2 O M 2 matrix multiply into an OMlog2M O M 2 M operation.

Footnotes

  1. When implementing the multi-level transform, you must ensure that the data length does not become shorter than the filter length!

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