# 0.1 Preliminaries

 Page 1 / 5
This collection of modules is from a Rice University, ECE Department Technical Report written around September 1994. It grew out of the doctoral and post doctoral research of Ivan Selesnick working with Prof. C. Sidney Burrus at Rice. Earlier reports on this work were published in the ICASSP and ISCAS conference proceedings in 1992-94 and a fairly complete report was published in the IEEE Transaction on Signal Processing in January 1996.

## Preliminaries

Because we compute prime point DFTs by converting them in to circular convolutions, most of this and the next section is devotedto an explanation of the split nesting convolution algorithm. In this section we introduce the various operations neededto carry out the split nesting algorithm. In particular, we describe the prime factor permutationthat is used to convert a one-dimensional circular convolution into a multi-dimensional one.We also discuss the reduction operations needed when the Chinese Remainder Theorem for polynomials is usedin the computation of convolution. The reduction operations needed for the split nesting algorithmare particularly well organized. We give an explicit matrix description of the reduction operationsand give a program that implements the action of these reduction operations.

The presentation relies upon the notions of similarity transformations, companion matrices and Kronecker products.With them, we describe the split nesting algorithm in a manner that brings out its structure.We find that when companion matrices are used to describe convolution, the reduction operations block diagonalizesthe circular shift matrix.

The companion matrix of a monic polynomial, $M\left(s\right)={m}_{0}+{m}_{1}s+\cdots +{m}_{n-1}{s}^{n-1}+{s}^{n}$ is given by

${C}_{M}=\left[\begin{array}{cccc}& & & -{m}_{0}1\\ 1& & & -{m}_{1}\\ & \ddots & & ⋮\\ & & 1& -{m}_{n-1}\end{array}\right].$

Its usefulness in the following discussion comes from the following relation which permits a matrix formulationof convolution. Let

$\begin{array}{ccc}\hfill X\left(s\right)& =& {x}_{0}+{x}_{1}s+\cdots {x}_{n-1}{s}^{n-1}\hfill \\ \hfill H\left(s\right)& =& {h}_{0}+{h}_{1}s+\cdots {h}_{n-1}{s}^{n-1}\hfill \\ \hfill Y\left(s\right)& =& {y}_{0}+{y}_{1}s+\cdots {y}_{n-1}{s}^{n-1}\hfill \\ \hfill M\left(s\right)& =& {m}_{0}+{m}_{1}s+\cdots {m}_{n-1}{s}^{n-1}+{s}^{n}\hfill \end{array}$

Then

$Y\left(s\right)=\phantom{\rule{3.33333pt}{0ex}}⟨\phantom{\rule{0.277778em}{0ex}}H\left(s\right)X\left(s\right){⟩}_{M\left(s\right)}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}⇔\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}y=\left(\sum _{k=0}^{n-1},{h}_{k},{C}_{M}^{k}\right)x$

where $y={\left({y}_{0},\cdots ,{y}_{n-1}\right)}^{t}$ , $x={\left({x}_{0},\cdots ,{x}_{n-1}\right)}^{t}$ , and ${C}_{M}$ is the companion matrix of $M\left(s\right)$ . In [link] , we say $y$ is the convolution of $x$ and $h$ with respect to $M\left(s\right)$ . In the case of circular convolution, $M\left(s\right)={s}^{n}-1$ and ${C}_{{s}^{n}-1}$ is the circular shift matrixdenoted by ${S}_{n}$ ,

${S}_{n}=\left[\begin{array}{cccc}& & & 1\\ 1& & & \\ & \ddots & & \\ & & 1& \end{array}\right]$

Notice that any circulant matrix can be written as ${\sum }_{k}{h}_{k}{S}_{n}^{k}$ .

Similarity transformations can be used to interpret the action of some convolution algorithms. If ${C}_{M}={T}^{-1}AT$ for some matrix $T$ ( ${C}_{M}$ and $A$ are similar, denoted ${C}_{M}\sim A$ ), then [link] becomes

$y={T}^{-1}\left(\sum _{k=0}^{n-1},{h}_{k},{A}^{k}\right)Tx.$

That is, by employing the similarity transformation given by $T$ in this way, the action of ${S}_{n}^{k}$ is replaced by that of ${A}^{k}$ . Many circular convolution algorithms can be understood,in part, by understanding the manipulations made to ${S}_{n}$ and the resulting new matrix $A$ . If the transformation $T$ is to be useful, it must satisfy two requirements:(1) $Tx$ must be simple to compute, and (2) $A$ must have some advantageous structure. For example, by the convolution property of the DFT,the DFT matrix $F$ diagonalizes ${S}_{n}$ ,

${S}_{n}={F}^{-1}\left[\begin{array}{cccc}{w}^{0}& & & \\ & {w}^{1}& & \\ & & \ddots & \\ & & & {w}^{n-1}\end{array}\right]F$

so that it diagonalizes every circulant matrix. In this case, $Tx$ can be computed by using an FFT and the structure of $A$ is the simplest possible. So the two above mentioned conditions are met.

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
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
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
Got questions? Join the online conversation and get instant answers! By Frank Levy By OpenStax By Maureen Miller By Vongkol HENG By Jonathan Long By Katy Pratt By OpenStax By OpenStax By OpenStax By Brooke Delaney