# 0.1 Preliminaries  (Page 2/5)

 Page 2 / 5

The Winograd Structure can be described in this manner also. Suppose $M\left(s\right)$ can be factored as $M\left(s\right)={M}_{1}\left(s\right){M}_{2}\left(s\right)$ where ${M}_{1}$ and ${M}_{2}$ have no common roots, then ${C}_{M}\sim \left({C}_{{M}_{1}},\oplus ,{C}_{{M}_{2}}\right)$ where $\oplus$ denotes the matrix direct sum. Using this similarity and recalling [link] , the original convolution is decomposed intodisjoint convolutions. This is, in fact, a statement of the Chinese Remainder Theoremfor polynomials expressed in matrix notation. In the case of circular convolution, ${s}^{n}-1={\prod }_{d|n}{\Phi }_{d}\left(s\right)$ , so that ${S}_{n}$ can be transformed to a block diagonal matrix,

${S}_{n}\sim \left[\begin{array}{cccc}{C}_{{\Phi }_{1}}& & & \\ & {C}_{{\Phi }_{d}}& & \\ & & \ddots & \\ & & & {C}_{{\Phi }_{n}}\end{array}\right]=\left(\underset{d|n}{\oplus },{C}_{{\Phi }_{d}}\right)$

where ${\Phi }_{d}\left(s\right)$ is the ${d}^{th}$ cyclotomic polynomial. In this case, each block represents a convolutionwith respect to a cyclotomic polynomial, or a `cyclotomic convolution'.Winograd's approach carries out these cyclotomic convolutions using the Toom-Cook algorithm.Note that for each divisor, $d$ , of $n$ there is a corresponding block on the diagonal of size $\phi \left(d\right)$ , for the degree of ${\Phi }_{d}\left(s\right)$ is $\phi \left(d\right)$ where $\phi \left(·\right)$ is the Euler totient function. This method is good for short lengths, butas $n$ increases the cyclotomic convolutions become cumbersome,for as the number of distinct prime divisors of $d$ increases, the operation described by ${\sum }_{k}{h}_{k}{\left({C}_{{\Phi }_{d}}\right)}^{k}$ becomes more difficult to implement.

The Agarwal-Cooley Algorithm utilizes the fact that

${S}_{n}={P}^{t}\left({S}_{{n}_{1}},\otimes ,{S}_{{n}_{2}}\right)P$

where $n={n}_{1}{n}_{2}$ , $\left({n}_{1},{n}_{2}\right)=1$ and $P$ is an appropriate permutation [link] . This converts the one dimensional circular convolutionof length $n$ to a two dimensional one of length ${n}_{1}$ along one dimension and length ${n}_{2}$ along the second.Then an ${n}_{1}$ -point and an ${n}_{2}$ -point circular convolution algorithm can be combined to obtain an $n$ -point algorithm. In polynomial notation, the mapping accomplished bythis permutation $P$ can be informally indicated by

$Y\left(s\right)=\phantom{\rule{3.33333pt}{0ex}}⟨\phantom{\rule{0.277778em}{0ex}}X\left(s\right)H\left(s\right){⟩}_{{s}^{n}-1}\stackrel{P}{⇔}Y\left(s,t\right)=\phantom{\rule{3.33333pt}{0ex}}⟨\phantom{\rule{0.277778em}{0ex}}X\left(s,t\right)H\left(s,t\right){⟩}_{{s}^{{n}_{1}}-1,{t}^{{n}_{2}}-1}.$

It should be noted that [link] implies that a circulant matrix of size ${n}_{1}{n}_{2}$ can be written as a block circulant matrix with circulantblocks.

The Split-Nesting algorithm [link] combines the structures of the Winograd and Agarwal-Cooley methods, so that ${S}_{n}$ is transformed to a block diagonalmatrix as in [link] ,

${S}_{n}\phantom{\rule{0.166667em}{0ex}}\sim \phantom{\rule{0.166667em}{0ex}}\underset{d|n}{\oplus }\Psi \left(d\right).$

Here $\Psi \left(d\right)={\otimes }_{p|d,p\in \mathcal{P}}{C}_{{\Phi }_{{H}_{d}\left(p\right)}}$ where ${H}_{d}\left(p\right)$ is the highest power of $p$ dividing $d$ , and $\mathcal{P}$ is the set of primes.

${S}_{45}\sim \left[\begin{array}{cccccc}1& & & & & \\ & {C}_{{\Phi }_{3}}& & & & \\ & & {C}_{{\Phi }_{9}}& & & \\ & & & {C}_{{\Phi }_{5}}& & \\ & & & & {C}_{{\Phi }_{3}}\otimes {C}_{{\Phi }_{5}}& \\ & & & & & {C}_{{\Phi }_{9}}\otimes {C}_{{\Phi }_{5}}\end{array}\right]$

In this structure a multidimensional cyclotomic convolution, represented by $\Psi \left(d\right)$ , replaces each cyclotomic convolution in Winograd's algorithm (represented by ${C}_{{\Phi }_{d}}$ in [link] . Indeed, if the product of ${b}_{1},\cdots ,{b}_{k}$ is $d$ and they are pairwise relatively prime, then ${C}_{{\Phi }_{d}}\sim {C}_{{\Phi }_{{b}_{1}}}\otimes \cdots \otimes {C}_{{\Phi }_{{b}_{k}}}$ . This gives a method for combining cyclotomic convolutionsto compute a longer circular convolution. It is like the Agarwal-Cooley method but requires feweradditions [link] .

## Prime factor permutations

One can obtain ${S}_{{n}_{1}}\otimes {S}_{{n}_{2}}$ from ${S}_{{n}_{1}{n}_{2}}$ when $\left({n}_{1},{n}_{2}\right)=1$ , for in this case, ${S}_{n}$ is similar to ${S}_{{n}_{1}}\otimes {S}_{{n}_{2}}$ , $n={n}_{1}{n}_{2}$ . Moreover, they are related by a permutation.This permutation is that of the prime factor FFT algorithms and is employed in nesting algorithmsfor circular convolution [link] , [link] . The permutation is described by Zalcstein [link] , among others, and it is his description we draw on in the following.

Let $n={n}_{1}{n}_{2}$ where $\left({n}_{1},{n}_{2}\right)=1$ . Define ${e}_{k}$ , ( $0\le k\le n-1$ ), to be the standard basis vector, ${\left(0,\cdots ,0,1,0,\cdots ,0\right)}^{t}$ , where the 1 is in the ${k}^{th}$ position. Then, the circular shift matrix, ${S}_{n}$ , can be described by

are nano particles real
yeah
Joseph
Hello, if I study Physics teacher in bachelor, can I study Nanotechnology in master?
no can't
Lohitha
where we get a research paper on Nano chemistry....?
nanopartical of organic/inorganic / physical chemistry , pdf / thesis / review
Ali
what are the products of Nano chemistry?
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
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
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
ya I also want to know the raman spectra
Bhagvanji
I only see partial conversation and what's the question here!
what about nanotechnology for water purification
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
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?
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 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 ?
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
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!