# 0.6 Winograd's short dft algorithms  (Page 3/11)

 Page 3 / 11
$Y\left(s\right)={K}_{1}\left(s\right){U}_{1}\left(s\right){H}_{1}\left(s\right)+{K}_{2}\left(s\right){U}_{2}\left(s\right){H}_{2}\left(s\right)+{K}_{3}\left(s\right){U}_{3}\left(s\right){H}_{3}\left(s\right)$

mod $\left({s}^{4}-1\right)$

where ${U}_{1}\left(s\right)={r}_{1}$ and ${U}_{2}\left(s\right)={r}_{2}$ are constants and ${U}_{3}\left(s\right)={v}_{0}+{v}_{1}s$ is a first degree polynomial. ${U}_{1}$ times ${H}_{1}$ and ${U}_{2}$ times ${H}_{2}$ are easy, but multiplying ${U}_{3}$ time ${H}_{3}$ modulo $\left({s}^{2}+1\right)$ is more difficult.

The multiplication of ${U}_{3}\left(s\right)$ times ${H}_{3}\left(s\right)$ can be done by the Toom-Cook algorithm [link] , [link] , [link] which can be viewed as Lagrange interpolation or polynomial multiplication modulo a specialpolynomial with three arbitrary coefficients. To simplify the arithmetic, the constants are chosen to be plus and minus one andzero. The details of this can be found in [link] , [link] , [link] . For this example it can be verified that

${\left(\left(v0+v1s\right)\left(h0+h1s\right)\right)\right)}_{{s}^{2}+1}=\left({v}_{0}{h}_{0}-{v}_{1}{h}_{1}\right)+\left({v}_{0}{h}_{1}+{v}_{1}{h}_{0}\right)s$

which by the Toom-Cook algorithm or inspection is

$\left[\begin{array}{ccc}1& -1& 0\\ -1& -1& 1\end{array}\right]\left[\left[\begin{array}{cc}1& 0\\ 0& 1\\ 1& 1\end{array}\right],\left[\begin{array}{c}{v}_{0}\\ {v}_{1}\end{array}\right],o,\left[\begin{array}{cc}1& 0\\ 0& 1\\ 1& 1\end{array}\right],\left[\begin{array}{c}{h}_{0}\\ {h}_{1}\end{array}\right]\right]=\left[\begin{array}{c}{y}_{0}\\ {y}_{1}\end{array}\right]$

where $o$ signifies point-by-point multiplication. The total $A$ matrix in [link] is a combination of [link] and [link] giving

$AX={A}_{1}{A}_{2}{A}_{3}X$
$=\left[\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 0& 0& 1& 0\\ 0& 0& 0& 1\\ 0& 0& 1& 1\end{array}\right]\left[\begin{array}{cccc}1& 1& 0& 0\\ 1& -1& 0& 0\\ 0& 0& 1& 0\\ 0& 0& 0& 1\end{array}\right]\left[\begin{array}{cccc}1& 0& 1& 0\\ 0& 1& 0& 1\\ 1& 0& -1& 0\\ 0& 1& 0& -1\end{array}\right]\left[\begin{array}{c}{u}_{0}\\ {u}_{1}\\ {u}_{2}\\ {u}_{3}\end{array}\right]=\left[\begin{array}{c}{r}_{0}\\ {r}_{1}\\ {v}_{0}\\ {v}_{1}\end{array}\right]$

where the matrix ${A}_{3}$ gives the residue reduction ${s}^{2}-1$ and ${s}^{2}+1$ , the upper left-hand part of ${A}_{2}$ gives the reduction modulo $s-1$ and $s+1$ , and the lower right-hand part of A1 carries out the Toom-Cook algorithm modulo ${s}^{2}+1$ with the multiplication in [link] . Notice that by calculating [link] in the three stages, seven additions are required. Also notice that ${A}_{1}$ is not square. It is this “expansion" that causes more than $N$ multiplications to be required in $o$ in [link] or $D$ in [link] . This staged reduction will derive the $A$ operator for [link]

The method described above is very straight-forward for the shorter DFT lengths. For $N=3$ , both of the residue polynomials are constants and the multiplication given by o in [link] is trivial. For $N=5$ , which is the example used here, there is one first degree polynomial multiplication required but the Toom-Cookalgorithm uses simple constants and, therefore, works well as indicated in [link] . For $N=7$ , there are two first degree residue polynomials which can each be multiplied by the sametechniques used in the $N=5$ example. Unfortunately, for any longer lengths, the residue polynomials have an order of three orgreater which causes the Toom-Cook algorithm to require constants of plus and minus two and worse. For that reason, the Toom-Cook methodis not used, and other techniques such as index mapping are used that require more than the minimum number of multiplications, but donot require an excessive number of additions. The resulting algorithms still have the structure of [link] . Blahut [link] and Nussbaumer [link] have a good collection of algorithms for polynomial multiplication that can be used with thetechniques discussed here to construct a wide variety of DFT algorithms.

The constants in the diagonal matrix $D$ can be found from the CRT matrix $C$ in [link] using $d={C}^{T}H$ ' for the diagonal terms in $D$ . As mentioned above, for the smaller prime lengths of 3, 5, and 7 this works well but for longer lengths the CRT becomesvery complicated. An alternate method for finding $D$ uses the fact that since the linear form [link] or [link] calculates the DFT, it is possible to calculate a known DFT of a given $x\left(n\right)$ from the definition of the DFT in Multidimensional Index Mapping: Equation 1 and, given the $A$ matrix in [link] , solve for $D$ by solving a set of simultaneous equations. The details of this procedure are described in [link] .

#### Questions & Answers

how can chip be made from sand
Eke Reply
are nano particles real
Missy Reply
yeah
Joseph
Hello, if I study Physics teacher in bachelor, can I study Nanotechnology in master?
Lale Reply
no can't
Lohitha
where we get a research paper on Nano chemistry....?
Maira Reply
nanopartical of organic/inorganic / physical chemistry , pdf / thesis / review
Ali
what are the products of Nano chemistry?
Maira Reply
There are lots of products of nano chemistry... Like nano coatings.....carbon fiber.. And lots of others..
learn
Even nanotechnology is pretty much all about chemistry... Its the chemistry on quantum or atomic level
learn
Google
da
no nanotechnology is also a part of physics and maths it requires angle formulas and some pressure regarding concepts
Bhagvanji
hey
Giriraj
Preparation and Applications of Nanomaterial for Drug Delivery
Hafiz Reply
revolt
da
Application of nanotechnology in medicine
has a lot of application modern world
Kamaluddeen
yes
narayan
what is variations in raman spectra for nanomaterials
Jyoti Reply
ya I also want to know the raman spectra
Bhagvanji
I only see partial conversation and what's the question here!
Crow Reply
what about nanotechnology for water purification
RAW Reply
please someone correct me if I'm wrong but I think one can use nanoparticles, specially silver nanoparticles for water treatment.
Damian
yes that's correct
Professor
I think
Professor
Nasa has use it in the 60's, copper as water purification in the moon travel.
Alexandre
nanocopper obvius
Alexandre
what is the stm
Brian Reply
is there industrial application of fullrenes. What is the method to prepare fullrene on large scale.?
Rafiq
industrial application...? mmm I think on the medical side as drug carrier, but you should go deeper on your research, I may be wrong
Damian
How we are making nano material?
LITNING Reply
what is a peer
LITNING Reply
What is meant by 'nano scale'?
LITNING Reply
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 simplest way to understand the applications of nano robots used to detect the cancer affected cell of human body.? How this robot is carried to required site of body cell.? what will be the carrier material and how can be detected that correct delivery of drug is done Rafiq
Rafiq
if virus is killing to make ARTIFICIAL DNA OF GRAPHENE FOR KILLED THE VIRUS .THIS IS OUR ASSUMPTION
Anam
analytical skills graphene is prepared to kill any type viruses .
Anam
Any one who tell me about Preparation and application of Nanomaterial for drug Delivery
Hafiz
what is Nano technology ?
Bob Reply
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
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
Good
Got questions? Join the online conversation and get instant answers!
Jobilize.com Reply

### Read also:

#### Get Jobilize Job Search Mobile App in your pocket 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?

 By Madison Christian By Robert Morris By Madison Christian By Stephen Voron By OpenStax By OpenStax By OpenStax By Katie Montrose By Alec Moffit By OpenStax