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

#### Questions & Answers

how can chip be made from sand
Eke Reply
is this allso about nanoscale material
Almas
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 is the latest information on a no technology how can I find it
William
currently
William
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
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 OpenStax By OpenStax By George Turner By Madison Christian By Miranda Reising By OpenStax By Jordon Humphreys By Savannah Parrish By Stephanie Redfern By OpenStax