<< Chapter < Page Chapter >> Page >

Here we use three methods to facilitate the construction of prime length FFT modules. First, the matrix exchange property [link] , [link] , [link] is used so that the transpose of the reduction operator can be used rather than the morecomplicated CRT reconstruction operator. This is then combined with the numerical method [link] for obtaining the multiplication coefficients rather than the direct use of the CRT. We also deviate from the Toom-Cook algorithm,because it requires too many additions for the lengths in which we are interested. Instead we use an iterated polynomial multiplication algorithm [link] . We have incorporated these three ideas into a single structural procedure that automatesthe design of prime length FFTs.

Matrix description

It is important that each step in the Winograd FFT can be described using matrices. By expressing cyclic convolution as a bilinear form, a compact form of prime length DFTs can be obtained.

If y is the cyclic convolution of h and x , then y can be expressed as

y = C [ A x . * B h ]

where, using the Matlab convention, . * represents point by point multiplication. When A , B , and C are allowed to be complex, A and B are seen to be the DFT operator and C , the inverse DFT. When only real numbers are allowed, A , B , and C will be rectangular. This form of convolution is presented with many examples in [link] . Using the matrix exchange property explained in [link] and [link] this form can be written as

y = R B T [ C T R h . * A x ]

where R is the permutation matrix that reverses order.

When h is fixed, as it is when considering prime length DFTs, the term C T R h can be precomputed and a diagonal matrix D formed by D = d i a g { C T R h } . This is advantageous because in general, C is more complicated than B , so the ability to “hide" C saves computation. Now y = R B T D A x or y = R A T D A x since A and B can be the same; they implement a polynomial reduction. The form y = R T D A x T can also be used for the prime length DFTs, it is only necessary to permute the entries of x and to ensure that theDC term is computed correctly. The computation of the DC term is simple, for the residue of a polynomial modulo a - 1 is always the sum of the coefficients. After adding the x 0 term of the original input sequence, to the s - l residue, the DC term is obtained. Now D F T { x } = R A T D A x . In [link] Johnson observes that by permuting the elements on the diagonal of D , the output can be permuted, so that the R matrix can be hidden in D , and D F T { x } = A T D A x . From the knowledge of this form, once A is found, D can be found numerically [link] .

Programming the design procedure

Because each of the above steps can be described by matrices, the development of a prime length FFTs is made convenient with the use of a matrix oriented programminglanguage such as Matlab. After specifying the appropriate matrices that describe the desired FFT algorithm, generating code involves compiling the matrices into the desiredcode for execution.

Each matrix is a section of one stage of the flow graph that corresponds to the DFT program. The four stages are:

  1. Permutation Stage: Permutes input and output sequence.
  2. Reduction Stage: Reduces the cyclic convolution to smaller polynomial products.
  3. Polynomial Product Stage: Performs the polynomial multiplications.
  4. Multiplication Stage: Implements the point-by-point multiplication in the bilinear form.

Questions & Answers

what is mutation
Janga Reply
what is a cell
Sifune Reply
how is urine form
Sifune
what is antagonism?
mahase Reply
classification of plants, gymnosperm features.
Linsy Reply
what is the features of gymnosperm
Linsy
how many types of solid did we have
Samuel Reply
what is an ionic bond
Samuel
What is Atoms
Daprince Reply
what is fallopian tube
Merolyn
what is bladder
Merolyn
what's bulbourethral gland
Eduek Reply
urine is formed in the nephron of the renal medulla in the kidney. It starts from filtration, then selective reabsorption and finally secretion
onuoha Reply
State the evolution relation and relevance between endoplasmic reticulum and cytoskeleton as it relates to cell.
Jeremiah
what is heart
Konadu Reply
how is urine formed in human
Konadu
how is urine formed in human
Rahma
what is the diference between a cavity and a canal
Pelagie Reply
what is the causative agent of malaria
Diamond
malaria is caused by an insect called mosquito.
Naomi
Malaria is cause by female anopheles mosquito
Isaac
Malaria is caused by plasmodium Female anopheles mosquitoe is d carrier
Olalekan
a canal is more needed in a root but a cavity is a bad effect
Commander
what are pathogens
Don Reply
In biology, a pathogen (Greek: πάθος pathos "suffering", "passion" and -γενής -genēs "producer of") in the oldest and broadest sense, is anything that can produce disease. A pathogen may also be referred to as an infectious agent, or simply a germ. The term pathogen came into use in the 1880s.[1][2
Zainab
A virus
Commander
Definition of respiration
Muhsin Reply
respiration is the process in which we breath in oxygen and breath out carbon dioxide
Achor
how are lungs work
Commander
where does digestion begins
Achiri Reply
in the mouth
EZEKIEL
what are the functions of follicle stimulating harmones?
Rashima Reply
stimulates the follicle to release the mature ovum into the oviduct
Davonte
what are the functions of Endocrine and pituitary gland
Chinaza
endocrine secrete hormone and regulate body process
Achor
while pituitary gland is an example of endocrine system and it's found in the Brain
Achor
what's biology?
Egbodo Reply
Biology is the study of living organisms, divided into many specialized field that cover their morphology, physiology,anatomy, behaviour,origin and distribution.
Lisah
biology is the study of life.
Alfreda
Biology is the study of how living organisms live and survive in a specific environment
Sifune
Got questions? Join the online conversation and get instant answers!
Jobilize.com Reply

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Fast fourier transforms. OpenStax CNX. Nov 18, 2012 Download for free at http://cnx.org/content/col10550/1.22
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Fast fourier transforms' conversation and receive update notifications?

Ask