# 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.

#### Questions & Answers

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
characteristics of micro business
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
Got questions? Join the online conversation and get instant answers!