<< Chapter < Page Chapter >> Page >
u ( D F T ( N ) ) = 2 N - m 2 - m - 2

This result is not practically useful because the number of additions necessary to realize this minimum of multiplicationsbecomes very large for lengths greater than 16. Nevertheless, it proves the minimum number of multiplications required of an optimalalgorithm is a linear function of N rather than of N log N which is that required of practical algorithms. The best practical power-of-two algorithm seems to the Split-Radix [link] FFT discussed in The Cooley-Tukey Fast Fourier Transform Algorithm: The Split-Radix FFT Algorithm .

All of these theorems use ideas based on residue reduction, multiplication of the residues, and then combination by the CRT. Itis remarkable that this approach finds the minimum number of required multiplications by a constructive proof which generates analgorithm that achieves this minimum; and the structure of the optimal algorithm is, within certain variations, unique. For shorterlengths, the optimal algorithms give practical programs. For longer lengths the uncounted operations involved with the multiplication ofthe higher degree residue polynomials become very large and impractical. In those cases, efficient suboptimal algorithms can begenerated by using the same residue reduction as for the optimal case, but by using methods other than the Toom-Cook algorithm of Theorem 1 to multiply the residue polynomials.

Practical long DFT algorithms are produced by combining short prime length optimal DFT's with the Type 1 index map from Multidimensional Index Mapping to give the Prime Factor Algorithm (PFA) and the Winograd Fourier Transform Algorithm (WFTA) discussed in The Prime Factor and Winograd Fourier Transform Algorithms . It is interesting to note that the index mapping technique is useful inside the short DFT algorithms to replace the Toom-Cookalgorithm and outside to combine the short DFT's to calculate long DFT's.

The automatic generation of winograd's short dfts

by Ivan Selesnick, Polytechnic Institute of New York University


Efficient prime length DFTs are important for two reasons. A particular application may require a prime length DFT and secondly, the maximum lengthand the variety of lengths of a PFA or WFTA algorithm depend upon the availability of prime length modules.

This [link] , [link] , [link] , [link] discusses automation of the process Winograd used for constructing prime length FFTs [link] , [link] for N < 7 and that Johnson and Burrus [link] extended to N < 19 . It also describes a program that will design any prime length FFT in principle,and will also automatically generate the algorithm as a C program and draw the corresponding flow graph.

Winograd's approach uses Rader's method to convert a prime length DFT into a P - 1 length cyclic convolution, polynomial residue reduction to decompose the problem into smaller convolutions [link] , [link] , and the Toom-Cook algorithm [link] , [link] . The Chinese Remainder Theorem (CRT) for polynomials is then used to recombine theshorter convolutions. Unfortunately, the design procedure derived directly from Winograd's theory becomes cumbersome for longer length DFTs, and this has oftenprevented the design of DFT programs for lengths greater than 19.

Questions & Answers

what is Nano technology ?
Bob Reply
write examples of Nano molecule?
The nanotechnology is as new science, to scale nanometric
nanotechnology is the study, desing, synthesis, manipulation and application of materials and functional systems through control of matter at nanoscale
Is there any normative that regulates the use of silver nanoparticles?
Damian Reply
what king of growth are you checking .?
What fields keep nano created devices from performing or assimulating ? Magnetic fields ? Are do they assimilate ?
Stoney Reply
why we need to study biomolecules, molecular biology in nanotechnology?
Adin Reply
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
what school?
biomolecules are e building blocks of every organics and inorganic materials.
anyone know any internet site where one can find nanotechnology papers?
Damian Reply
sciencedirect big data base
Introduction about quantum dots in nanotechnology
Praveena Reply
what does nano mean?
Anassong Reply
nano basically means 10^(-9). nanometer is a unit to measure length.
do you think it's worthwhile in the long term to study the effects and possibilities of nanotechnology on viral treatment?
Damian Reply
absolutely yes
how to know photocatalytic properties of tio2 nanoparticles...what to do now
Akash Reply
it is a goid question and i want to know the answer as well
characteristics of micro business
for teaching engĺish at school how nano technology help us
Do somebody tell me a best nano engineering book for beginners?
s. Reply
there is no specific books for beginners but there is book called principle of nanotechnology
what is fullerene does it is used to make bukky balls
Devang Reply
are you nano engineer ?
fullerene is a bucky ball aka Carbon 60 molecule. It was name by the architect Fuller. He design the geodesic dome. it resembles a soccer ball.
what is the actual application of fullerenes nowadays?
That is a great question Damian. best way to answer that question is to Google it. there are hundreds of applications for buck minister fullerenes, from medical to aerospace. you can also find plenty of research papers that will give you great detail on the potential applications of fullerenes.
what is the Synthesis, properties,and applications of carbon nano chemistry
Abhijith Reply
Mostly, they use nano carbon for electronics and for materials to be strengthened.
is Bucky paper clear?
carbon nanotubes has various application in fuel cells membrane, current research on cancer drug,and in electronics MEMS and NEMS etc
so some one know about replacing silicon atom with phosphorous in semiconductors device?
s. Reply
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Do you know which machine is used to that process?
how to fabricate graphene ink ?
for screen printed electrodes ?
What is lattice structure?
s. Reply
of graphene you mean?
or in general
in general
Graphene has a hexagonal structure
On having this app for quite a bit time, Haven't realised there's a chat room in it.
how did you get the value of 2000N.What calculations are needed to arrive at it
Smarajit Reply
Privacy Information Security Software Version 1.1a
Got questions? Join the online conversation and get instant answers!
Jobilize.com Reply

Get the best Algebra and trigonometry course in your pocket!

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?