# 0.3 Polynomial description of signals  (Page 2/2)

 Page 2 / 2
$Y\left(s\right)=H\left(s\right)X\left(s\right)\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}\text{mod}\phantom{\rule{4pt}{0ex}}P\left(s\right)$

where $P\left(s\right)={s}^{N}-1$ , and if $P\left(s\right)$ is factored into two relatively prime factors $P={P}_{1}{P}_{2}$ , using residue reduction of $H\left(s\right)$ and $X\left(s\right)$ modulo ${P}_{1}$ and ${P}_{2}$ , the lower degree residue polynomials can be multiplied and the results recombined with theCRT. This is done by

$Y\left(s\right)={\left(\left({K}_{1}{H}_{1}{X}_{1}+{K}_{2}{H}_{2}{X}_{2}\right)\right)}_{P}$

where

${H}_{1}={\left(\left(H\right)\right)}_{{P}_{1}},\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}{X}_{1}={\left(\left(X\right)\right)}_{{P}_{1}},\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}{H}_{2}={\left(\left(H\right)\right)}_{{P}_{2}},\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}{X}_{2}={\left(\left(X\right)\right)}_{{P}_{2}}$

and $K1$ and $K2$ are the CRT coefficient polynomials from [link] . This allows two shorter convolutions to replace one longer one.

Another property of residue reduction that is useful in DFT calculation is polynomial evaluation. To evaluate $F\left(s\right)$ at $s=x$ , $F\left(s\right)$ is reduced modulo $s-x$ .

$F\left(x\right)={\left(\left(F\left(s\right)\right)\right)}_{s-x}$

This is easily seen from the definition in [link]

$F\left(s\right)=Q\left(s\right)\left(s-x\right)+R\left(s\right)$

Evaluating $s=x$ gives $R\left(s\right)=F\left(x\right)$ which is a constant. For the DFT this becomes

$C\left(k\right)={\left(\left(X\left(s\right)\right)\right)}_{s-{W}^{k}}$

Details of the polynomial algebra useful in digital signal processing can be found in [link] , [link] , [link] .

## The dft as a polynomial evaluation

The Z-transform of a number sequence $x\left(n\right)$ is defined as

$X\left(z\right)=\sum _{n=0}^{\infty }x\left(n\right)\phantom{\rule{4pt}{0ex}}{z}^{-n}$

which is the same as the polynomial description in [link] but with a negative exponent. For a finite length-N sequence [link] becomes

$X\left(z\right)=\sum _{n=0}^{N-1}x\left(n\right)\phantom{\rule{4pt}{0ex}}{z}^{-n}$
$X\left(z\right)=x\left(0\right)+x\left(1\right){z}^{-1}+x\left(2\right){z}^{-2}+·+x\left(N-1\right){z}^{-N+1}$

This $N-1$ order polynomial takes on the values of the DFT of $x\left(n\right)$ when evaluated at

$z={e}^{j2\pi k/N}$

which gives

${C\left(k\right)=X\left(z\right)|}_{z={e}^{j2\pi k/N}}=\sum _{n=0}^{N-1}x\left(n\right)\phantom{\rule{4pt}{0ex}}{e}^{-j2\pi nk/N}$

In terms of the positive exponent polynomial from [link] , the DFT is

${C\left(k\right)=X\left(s\right)|}_{s={W}^{k}}$

where

$W={e}^{-j2\pi /N}$

is an ${N}^{th}$ root of unity (raising $W$ to the ${N}^{th}$ power gives one). The $N$ values of the DFT are found from $X\left(s\right)$ evaluated at the N ${N}^{th}$ roots of unity which are equally spaced around the unit circle in the complex $s$ plane.

One method of evaluating $X\left(z\right)$ is the so-called Horner's rule or nested evaluation. When expressed as a recursivecalculation, Horner's rule becomes the Goertzel algorithm which has some computational advantages especially when only a few values ofthe DFT are needed. The details and programs can be found in [link] , [link] and The DFT as Convolution or Filtering: Goertzel's Algorithm (or A Better DFT Algorithm)

Another method for evaluating $X\left(s\right)$ is the residue reduction modulo $\left(s-{W}^{k}\right)$ as shown in [link] . Each evaluation requires $N$ multiplications and therefore, ${N}^{2}$ multiplications for the $N$ values of $C\left(k\right)$ .

$C\left(k\right)={\left(\left(X\left(s\right)\right)\right)}_{\left(s-{W}^{k}\right)}$

A considerable reduction in required arithmetic can be achieved if some operations can be shared between the reductions for differentvalues of $k$ . This is done by carrying out the residue reduction in stages that can be shared rather than done in one step for each $k$ in [link] .

The $N$ values of the DFT are values of $X\left(s\right)$ evaluated at s equal to the $N$ roots of the polynomial $P\left(s\right)={s}^{N}-1$ which are ${W}^{k}$ . First, assuming $N$ is even, factor $P\left(s\right)$ as

$P\left(s\right)=\left({s}^{N}-1\right)={P}_{1}\left(s\right)\phantom{\rule{4pt}{0ex}}{P}_{2}\left(s\right)=\left({s}^{N/2}-1\right)\left({s}^{N/2}+1\right)$

$X\left(s\right)$ is reduced modulo these two factors to give two residue polynomials, ${X}_{1}\left(s\right)$ and ${X}_{2}\left(s\right)$ . This process is repeated by factoring ${P}_{1}$ and further reducing ${X}_{1}$ then factoring ${P}_{2}$ and reducing ${X}_{2}$ . This is continued until the factors are of first degree which gives the desired DFT values as in [link] . This is illustrated for a length-8 DFT. The polynomial whose roots are ${W}^{k}$ , factors as

$P\left(s\right)={s}^{8}-1$
$=\left[{s}^{4}-1\right]\left[{s}^{4}+1\right]$
$=\left[\left({s}^{2}-1\right)\left({s}^{2}+1\right)\right]\left[\left({s}^{2}-j\right)\left({s}^{2}+j\right)\right]$
$=\left[\left(s-1\right)\left(s+1\right)\left(s-j\right)\left(s+j\right)\right]\left[\left(s-a\right)\left(s+a\right)\left(s-ja\right)\left(s+ja\right)\right]$

where ${a}^{2}=j$ . Reducing $X\left(s\right)$ by the first factoring gives two third degree polynomials

$X\left(s\right)={x}_{0}+{x}_{1}s+{x}_{2}{s}^{2}+...+{x}_{7}{s}^{7}$

gives the residue polynomials

${X}_{1}\left(s\right)={\left(\left(X\left(s\right)\right)\right)}_{\left({s}^{4}-1\right)}=\left({x}_{0}+{x}_{4}\right)+\left({x}_{1}+{x}_{5}\right)s+\left({x}_{2}+{x}_{6}\right){s}^{2}+\left({x}_{3}+{x}_{7}\right){s}^{3}$
${X}_{2}\left(s\right)={\left(\left(X\left(s\right)\right)\right)}_{\left({s}^{4}+1\right)}=\left({x}_{0}-{x}_{4}\right)+\left({x}_{1}-{x}_{5}\right)s+\left({x}_{2}-{x}_{6}\right){s}^{2}+\left({x}_{3}-{x}_{7}\right){s}^{3}$

Two more levels of reduction are carried out to finally give the DFT. Close examination shows the resulting algorithm to be thedecimation-in-frequency radix-2 Cooley-Tukey FFT [link] , [link] . Martens [link] has used this approach to derive an efficient DFT algorithm.

Other algorithms and types of FFT can be developed using polynomial representations and some are presented in the generalization in DFT and FFT: An Algebraic View .

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
Do somebody tell me a best nano engineering book for beginners?
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
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
what's the easiest and fastest way to the synthesize AgNP?
China
Cied
types of nano material
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
I'm interested in nanotube
Uday
what is nanomaterials​ and their applications of sensors.
what is nano technology
what is system testing?
preparation of nanomaterial
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
what is system testing
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
Hello
Uday
I'm interested in Nanotube
Uday
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
Prasenjit
can nanotechnology change the direction of the face of the world
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!