http://iet.metastore.ingenta.com
1887

The Digital Filter Bank and the FFT

The Digital Filter Bank and the FFT

For access to this article, please select a purchase option:

Buy chapter PDF
£10.00
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Introduction to Airborne Radar — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The FFT is an algorithm which vastly reduces the amount of processing necessary to form a bank of digital filters with the DFT. Its efficiency is achieved primarily by choosing the parameters of the bank so that they are harmonically related and consolidating the formation of the filters into a single multiple-step process. By making the number of filters, N, equal to a power of two and the number of samples summed equal to N, the processing is accomplished in log2N steps. In the first step, each sample is algebraically summed with one of the other samples. In each succeeding step, certain phase rotations are performed, and each partial sum is algebraically summed with one of the other partial sums.The required phase rotations and pairing of the quantities to be summed in each step can readily be determined mathematically. The basic processing instruction for performing the individual partial summations - consisting of a phase rotation, a complex addition, and a complex subtraction - is called the FFT butterfly. The phase rotations themselves are performed the same way as in the DFT.

Chapter Contents:

  • Basic Concept
  • A Representative FFT
  • FFTs for Filter Banks of Any Size
  • Rules of Thumb for Estimating Number of Computations

Inspec keywords: discrete Fourier transforms; digital filters

Other keywords: digital filter bank; partial summation; complex subtraction; DFT; FFT; complex addition; phase rotation

Subjects: Integral transforms; Digital filters; Integral transforms; Digital filters

Preview this chapter:
Zoom in
Zoomout

The Digital Filter Bank and the FFT, Page 1 of 2

| /docserver/preview/fulltext/books/ra/sbra101e/SBRA101E_ch20-1.gif /docserver/preview/fulltext/books/ra/sbra101e/SBRA101E_ch20-2.gif

Related content

content/books/10.1049/sbra101e_ch20
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address