# 0.2 Implementation details

 Page 1 / 9

This Chapter complements the mathematical perspective of Algorithms with a more focused view of the low level details that are relevant to efficient implementation on SIMD microprocessors. These techniques arewidely practised by today's state of the art implementations, and form the basis for more advanced techniques presented in later chapters.

## Simple programs

Fast Fourier transforms (FFTs) can be succinctly expressed as microprocessor algorithms that are depth first recursive. Forexample, the Cooley-Tukey FFT divides a size N transform into two size N /2 transforms, which in turn are divided into size N /4 transforms. This recursion continues until the base case of two size 1transforms is reached, where the two smaller sub-transforms are then combined into a size 2 sub-transform, and then two completed size 2 transforms arecombined into a size 4 transform, and so on, until the size N transform is complete.

Computing the FFT with such a depth first traversal has an important advantage in terms of memory locality: at any point during the traversal, the two completedsub-transforms that compose a larger sub-transform will still be in the closest level of the memory hierarchy in which they fit (see, i.a., [link] and [link] ). In contrast, a breadth first traversal of a sufficiently large transform couldforce data out of cache during every pass (ibid.).

Many implementations of the FFT require a bit-reversal permutation of either the input or the output data, but a depth first recursive algorithm implicitlyperforms the permutation during recursion. The bit-reversal permutation is an expensive computation, and despite being the subject of hundreds of researchpapers over the years, it can easily account for a large fraction of the FFTs runtime – more so for the conjugate-pair algorithm with the rotatedbit-reversal permutation. Such permutations will be encountered in later sections, but for the mean time it should be noted that the algorithms inthis chapter do not require bit-reversal permutations – the input and output are in natural order.

IF  $N\phantom{\rule{3.33333pt}{0ex}}=\phantom{\rule{3.33333pt}{0ex}}1$     RETURN  ${x}_{0}$   ELSE      ${E}_{{k}_{2}=0,\cdots ,N/2-1}\phantom{\rule{3.33333pt}{0ex}}←\phantom{\rule{3.33333pt}{0ex}}\mathtt{DITFFT}{\mathtt{2}}_{N/2}\left({x}_{2{n}_{2}}\right)$      ${O}_{{k}_{2}=0,\cdots ,N/2-1}\phantom{\rule{3.33333pt}{0ex}}←\phantom{\rule{3.33333pt}{0ex}}\mathtt{DITFFT}{\mathtt{2}}_{N/2}\left({x}_{2{n}_{2}+1}\right)$     FOR  $k=0$  to  $N/2-1$        ${X}_{k}\phantom{\rule{3.33333pt}{0ex}}←\phantom{\rule{3.33333pt}{0ex}}{E}_{k}\phantom{\rule{3.33333pt}{0ex}}+\phantom{\rule{3.33333pt}{0ex}}{\omega }_{N}^{k}\phantom{\rule{3.33333pt}{0ex}}{O}_{k}$        ${X}_{k+N/2}\phantom{\rule{3.33333pt}{0ex}}←\phantom{\rule{3.33333pt}{0ex}}{E}_{k}\phantom{\rule{3.33333pt}{0ex}}-\phantom{\rule{3.33333pt}{0ex}}{\omega }_{N}^{k}\phantom{\rule{3.33333pt}{0ex}}{O}_{k}$     END FOR     RETURN  ${X}_{k}$   ENDIF ${\mathtt{DITFFT2}}_{N}\left({x}_{n}\right)$ 

A recursive depth first implementation of the Cooley-Tukey radix-2 decimation-in-time (DIT) FFT is described with pseudocode in [link] , and an implementation coded in C with only the most basic optimization – avoiding multiply operations where ${\omega }_{N}^{0}$ is unity in the first iteration of the loop – is included in Appendix 1 . Even when compiled with a state-of-the-art auto-vectorizing compiler, Intel(R) C Intel(R) 64 Compiler XE for applications running on Intel(R) 64, Version 12.1.0.038 Build 20110811. the code achieves poor performance on modern microprocessors, and is useful only asa baseline reference. Benchmark methods contains a full account of the benchmark methods.

 Implementation Machine Runtime Danielson-Lanczos, 1942 [link] Human 140 minutes Cooley-Tukey, 1965 [link] IBM 7094 $\sim$ 10.5 ms Listing 1, Appendix 1 , 2011 Macbook Air 4,2 $\sim$ 440 $\mu$ s

what is the stm
How we are making nano material?
what is a peer
What is meant by 'nano scale'?
What is STMs full form?
LITNING
scanning tunneling microscope
Sahil
how nano science is used for hydrophobicity
Santosh
Do u think that Graphene and Fullrene fiber can be used to make Air Plane body structure the lightest and strongest. Rafiq
Rafiq
what is differents between GO and RGO?
Mahi
what is Nano technology ?
write examples of Nano molecule?
Bob
The nanotechnology is as new science, to scale nanometric
brayan
nanotechnology is the study, desing, synthesis, manipulation and application of materials and functional systems through control of matter at nanoscale
Damian
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
How can I make nanorobot?
Lily
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
how can I make nanorobot?
Lily
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
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!