# 0.8 The cooley-tukey fast fourier transform algorithm  (Page 7/8)

 Page 7 / 8

Although there can be significant differences in the efficiencies of the various Cooley-Tukey and Split-Radix FFTs, thenumber of multiplications and additions for all of them is on the order of $NlogN$ . That is fundamental to the class of algorithms.

## The quick fourier transform, an fft based on symmetries

The development of fast algorithms usually consists of using special properties of the algorithm of interest to remove redundant or unnecessary operations of a direct implementation. The discrete Fourier transform(DFT) defined by

$C\left(k\right)=\sum _{n=0}^{N-1}x\left(n\right)\phantom{\rule{0.166667em}{0ex}}{W}_{N}^{nk}$

where

${W}_{N}={e}^{-j2\pi /N}$

has enormous capacity for improvement of its arithmetic efficiency. Most fast algorithms use the periodic and symmetric properties of its basisfunctions. The classical Cooley-Tukey FFT and prime factor FFT [link] exploit the periodic properties of the cosine and sine functions. Their use of the periodicities to share and, therefore, reduce arithmeticoperations depends on the factorability of the length of the data to be transformed. For highly composite lengths, the number of floating-pointoperation is of order $N\phantom{\rule{0.166667em}{0ex}}log\left(N\right)$ and for prime lengths it is of order ${N}^{2}$ .

This section will look at an approach using the symmetric properties to remove redundancies. This possibility has long been recognized [link] , [link] , [link] , [link] but has not been developed in any systematic way in the open literature. We will develop an algorithm,called the quick Fourier transform (QFT) [link] , that will reduce the number of floating point operations necessary to compute the DFT by afactor of two to four over direct methods or Goertzel's method for prime lengths. Indeed, it seems the best general algorithm available for primelength DFTs. One can always do better by using Winograd type algorithms but they must be individually designed for each length. The Chirp Z-transform can be used for longer lengths.

## Input and output symmetries

We use the fact that the cosine is an even function and the sine is an odd function. The kernel of the DFT or the basis functions of the expansion isgiven by

${W}_{N}^{nk}={e}^{-j2\pi nk/N}=cos\left(2\pi nk/N\right)+j\phantom{\rule{0.166667em}{0ex}}sin\left(2\pi nk/N\right)$

which has an even real part and odd imaginary part. If the data $x\left(n\right)$ are decomposed into their real and imaginary parts and those into their even andodd parts, we have

$x\left(n\right)=u\left(n\right)+j\phantom{\rule{0.166667em}{0ex}}v\left(n\right)=\left[{u}_{e}\left(n\right)+{u}_{o}\left(n\right)\right]+j\phantom{\rule{0.166667em}{0ex}}\left[{v}_{e}\left(n\right)+{v}_{o}\left(n\right)\right]$

where the even part of the real part of $x\left(n\right)$ is given by

${u}_{e}\left(n\right)=\left(u\left(n\right)+u\left(-n\right)\right)/2$

and the odd part of the real part is

${u}_{o}\left(n\right)=\left(u\left(n\right)-u\left(-n\right)\right)/2$

with corresponding definitions of ${v}_{e}\left(n\right)$ and ${v}_{o}\left(n\right)$ . Using Convolution Algorithms: Equation 32 with a simpler notation, the DFT of Convolution Algorithms: Equation 29 becomes

$C\left(k\right)=\sum _{n=0}^{N-1}\left(u+j\phantom{\rule{0.166667em}{0ex}}v\right)\left(cos-jsin\right).$

The sum over an integral number of periods of an odd function is zero and the sum of an even function over half of the period is one half the sumover the whole period. This causes [link] and [link] to become

$C\left(k\right)=\sum _{n=0}^{N/2-1}\left[{u}_{e}\phantom{\rule{0.166667em}{0ex}}cos+{v}_{o}\phantom{\rule{0.166667em}{0ex}}sin\right]+j\phantom{\rule{0.166667em}{0ex}}\left[{v}_{e}\phantom{\rule{0.166667em}{0ex}}cos-{v}_{o}\phantom{\rule{0.166667em}{0ex}}sin\right].$

for $k=0,1,2,\cdots ,N-1$ .

The evaluation of the DFT using equation [link] requires half as many real multiplication and half as many real additions as evaluating it using [link] or [link] . We have exploited the symmetries of the sine and cosine as functions of the time index $n$ . This is independent of whether the length is composite or not. Another view of this formulation is thatwe have used the property of associatively of multiplication and addition. In other words, rather than multiply two data points by the same value ofa sine or cosine then add the results, one should add the data points first then multiply the sum by the sine or cosine which requires onerather than two multiplications.

Is there any normative that regulates the use of silver nanoparticles?
what king of growth are you checking .?
Renato
What fields keep nano created devices from performing or assimulating ? Magnetic fields ? Are do they assimilate ?
why we need to study biomolecules, molecular biology in nanotechnology?
?
Kyle
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
why?
what school?
Kyle
biomolecules are e building blocks of every organics and inorganic materials.
Joe
anyone know any internet site where one can find nanotechnology papers?
research.net
kanaga
sciencedirect big data base
Ernesto
Introduction about quantum dots in nanotechnology
what does nano mean?
nano basically means 10^(-9). nanometer is a unit to measure length.
Bharti
do you think it's worthwhile in the long term to study the effects and possibilities of nanotechnology on viral treatment?
absolutely yes
Daniel
how to know photocatalytic properties of tio2 nanoparticles...what to do now
it is a goid question and i want to know the answer as well
Maciej
Abigail
for teaching engĺish at school how nano technology help us
Anassong
Do somebody tell me a best nano engineering book for beginners?
there is no specific books for beginners but there is book called principle of nanotechnology
NANO
what is fullerene does it is used to make bukky balls
are you nano engineer ?
s.
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.
Tarell
what is the actual application of fullerenes nowadays?
Damian
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.
Tarell
what is the Synthesis, properties,and applications of carbon nano chemistry
Mostly, they use nano carbon for electronics and for materials to be strengthened.
Virgil
is Bucky paper clear?
CYNTHIA
carbon nanotubes has various application in fuel cells membrane, current research on cancer drug,and in electronics MEMS and NEMS etc
NANO
so some one know about replacing silicon atom with phosphorous in semiconductors device?
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.
Harper
Do you know which machine is used to that process?
s.
how to fabricate graphene ink ?
for screen printed electrodes ?
SUYASH
What is lattice structure?
of graphene you mean?
Ebrahim
or in general
Ebrahim
in general
s.
Graphene has a hexagonal structure
tahir
On having this app for quite a bit time, Haven't realised there's a chat room in it.
Cied
what is biological synthesis of nanoparticles
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!