# 0.7 Dft and fft: an algebraic view  (Page 5/5)

 Page 5 / 5
${s}^{N}-1={\left({s}^{M}\right)}^{K}-1.$

Decomposition means that the polynomial is written as the composition of two polynomials: here, ${s}^{M}$ is inserted into ${s}^{K}-1$ . Note that this is a special property: most polynomials do not decompose.

Based on this polynomial decomposition, we obtain the following stepwise decomposition of $\mathbb{C}\left[s\right]/\left({s}^{N}-1\right)$ , which is more general than the previous one in [link][link] . The basic idea is to first decompose with respect to the outer polynomial ${t}^{K}-1$ , $t={s}^{M}$ , and then completely [link] :

$\begin{array}{ccc}& & \mathbb{C}\left[s\right]/\left({s}^{N}-1\right)=\mathbb{C}\left[x\right]/\left({\left({s}^{M}\right)}^{K}-1\right)\hfill \\ & \to & \underset{0\le i
$\begin{array}{ccc}& \to & \underset{0\le i
$\begin{array}{ccc}& \to & \underset{0\le i

As bases in the smaller algebras $\mathbb{C}\left[s\right]/\left({s}^{M}-{W}_{K}^{i}\right)$ we choose ${c}_{i}=\left(1,s,\cdots ,{s}^{M-1}\right)$ . As before, the derivation is completely mechanical from here: only the three matrices corresponding to [link][link] have to be read off.

The first decomposition step requires us to compute ${s}^{n}\phantom{\rule{4.pt}{0ex}}\text{mod}\phantom{\rule{4.pt}{0ex}}\left({s}^{M}-{W}_{K}^{i}\right)$ , $0\le n . To do so, we decompose the index $n$ as $n=\ell M+m$ and compute

${s}^{n}={s}^{\ell M+m}={\left({s}^{M}\right)}^{\ell }{s}^{m}\equiv {W}_{k}^{\ell m}{s}^{m}\phantom{\rule{4.pt}{0ex}}\text{mod}\phantom{\rule{4.pt}{0ex}}\left({s}^{M}-{W}_{K}^{i}\right).$

This shows that the matrix for [link] is given by ${DFT}_{K}\otimes {I}_{M}$ .

In step [link] , each $\mathbb{C}\left[s\right]/\left({s}^{M}-{W}_{K}^{i}\right)$ is completely decomposed by its polynomial transform

${DFT}_{M}\left(i,K\right)={DFT}_{M}·{diag}_{0\le i

At this point, $\mathbb{C}\left[s\right]/\left({s}^{N}-1\right)$ is completely decomposed, but the spectrum is ordered according to $jK+i$ , $0\le i , $0\le j ( $j$ runs faster). The desired order is $iM+j$ .

Thus, in step [link] , we need to apply the permutation $jK+i↦iM+j$ , which is exactly the stride permutation ${L}_{M}^{N}$ in [link] .

In summary, we obtain the Cooley-Tukey decimation-in-frequency FFT with arbitrary radix:

$\begin{array}{ccc}& & {L}_{M}^{N}\left(\underset{0\le i

The matrix ${T}_{M}^{N}$ is diagonal and usually called the twiddle matrix . Transposition using [link] yields the corresponding decimation-in-time version:

$\left({DFT}_{k}\otimes {I}_{M}\right){T}_{M}^{N}\left({I}_{K}\otimes {DFT}_{M}\right){L}_{K}^{N}.$

## Discussion and further reading

This chapter only scratches the surface of the connection between algebra and the DFT or signal processing in general. We providea few references for further reading.

## Algebraic derivation of transform algorithms

As mentioned before, the use of polynomial algebras and the CRT underlies much of the early work on FFTs and convolution algorithms [link] , [link] , [link] . For example, Winograd's work on FFTs minimizes the number of non-rational multiplications.This and his work on complexity theory in general makes heavy use of polynomial algebras [link] , [link] , [link] (see Chapter Winograd’s Short DFT Algorithms for more information and references). See [link] for a broad treatment of algebraic complexity theory.

Since $\mathbb{C}\left[x\right]/\left({s}^{N}-1\right)=\mathbb{C}\left[{C}_{N}\right]$ can be viewed a group algebra for the cyclic group, the methods shown in this chapter can be translated intothe context of group representation theory. For example, [link] derives the general-radix FFT using group theory and also uses already the Kronecker product formalism. So does Bethand started the area of FFTs for more general groups [link] , [link] . However, Fourier transforms for groups have found only sporadic applications [link] . Along a related line of work, [link] shows that using group theory it is possible that to discover and generate certain algorithmsfor trigonometric transforms, such as discrete cosine transforms (DCTs), automatically using a computer program.

More recently, the polynomial algebra framework was extended to include most trigonometric transforms used in signal processing [link] , [link] , namely, besides the DFT, the discrete cosine and sine transforms and various real DFTs including the discrete Hartley transform. It turns out that the sametechniques shown in this chapter can then be applied to derive, explain, and classify most of the known algorithms for thesetransforms and even obtain a large class of new algorithms including general-radix algorithms for the discrete cosine and sine transforms(DCTs/DSTs) [link] , [link] , [link] , [link] .

This latter line of work is part of the algebraic signal processing theory briefly discussed next.

## Algebraic signal processing theory

The algebraic properties of transforms used in the above work on algorithm derivation hints at a connection between algebra and(linear) signal processing itself. This is indeed the case and was fully developed in a recent body of work called algebraic signalprocessing theory (ASP). The foundation of ASP is developed in [link] , [link] , [link] .

ASP first identifies the algebraic structure of (linear) signal processing: the common assumptions on available operations for filtersand signals make the set of filters an algebra $\mathcal{A}$ and the set of signals an associated $\mathcal{A}$ -module $\mathcal{M}$ . ASP then builds a signal processing theory formally from the axiomaticdefinition of a signal model : a triple $\left(\mathcal{A},\mathcal{M},\Phi \right)$ , where $\Phi$ generalizes the idea of the $z$ -transform to mappings from vector spaces of signal values to $\mathcal{M}$ . If a signal model is given, other concepts, such as spectrum, Fourier transform, frequencyresponse are automatically defined but take different forms for different models. For example, infinite and finite time as discussedin [link] are two examples of signal models. Their complete definition is provided in [link] and identifies the proper notion of a finite $z$ -transform as a mapping ${\mathbb{C}}^{n}\to \mathbb{C}\left[s\right]/\left({s}^{n}-1\right)$ .

 Signal model Infinite time Finite time $\mathcal{A}$ $\left\{\sum _{n\in \mathbb{Z}}H\left(n\right){s}^{n}\mid \left(\cdots ,H\left(-1\right),H\left(0\right),H\left(1\right),\cdots \right)\in {\ell }^{1}\left(\mathbb{Z}\right)\right\}$ $\mathbb{C}\left[x\right]/\left({s}^{n}-1\right)$ $\mathcal{M}$ $\left\{\sum _{n\in \mathbb{Z}}X\left(n\right){s}^{n}\mid \left(\cdots ,X\left(-1\right),X\left(0\right),X\left(1\right),\cdots \right)\in {\ell }^{2}\left(\mathbb{Z}\right)\right\}$ $\mathbb{C}\left[s\right]/\left({s}^{n}-1\right)$ $\Phi$ $\Phi :\phantom{\rule{4pt}{0ex}}{\ell }^{2}\left(\mathbb{Z}\right)\to \mathcal{M}$ $\Phi :\phantom{\rule{4pt}{0ex}}{\mathbb{C}}^{n}\to \mathcal{M}$ defined in [link] defined in [link]

ASP shows that many signal models are in principle possible, each with its own notion of filtering and Fourier transform. Those that supportshift-invariance have commutative algebras. Since finite-dimensional commutative algebras are precisely polynomial algebras, theirappearance in signal processing is explained. For example, ASP identifies the polynomial algebras underlying the DCTs and DSTs, whichhence become Fourier transforms in the ASP sense. The signal models are called finite space models since they support signal processing based on an undirected shift operator, different from thedirected time shift. Many more insights are provided by ASP including the need for and choices in choosing boundary conditions, propertiesof transforms, techniques for deriving new signal models, and the concise derivation of algorithms mentioned before.

#### Questions & Answers

Is there any normative that regulates the use of silver nanoparticles?
Damian Reply
what king of growth are you checking .?
Renato
What fields keep nano created devices from performing or assimulating ? Magnetic fields ? Are do they assimilate ?
Stoney Reply
why we need to study biomolecules, molecular biology in nanotechnology?
Adin Reply
?
Kyle
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
Adin
why?
Adin
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?
Damian Reply
research.net
kanaga
sciencedirect big data base
Ernesto
Introduction about quantum dots in nanotechnology
Praveena Reply
what does nano mean?
Anassong Reply
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?
Damian Reply
absolutely yes
Daniel
how to know photocatalytic properties of tio2 nanoparticles...what to do now
Akash Reply
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?
s. Reply
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
Devang Reply
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
Abhijith Reply
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?
s. Reply
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 ?
SUYASH Reply
for screen printed electrodes ?
SUYASH
What is lattice structure?
s. Reply
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
Sanket Reply
how did you get the value of 2000N.What calculations are needed to arrive at it
Smarajit Reply
Privacy Information Security Software Version 1.1a
Good
Berger describes sociologists as concerned with
Mueller Reply
Got questions? Join the online conversation and get instant answers!
Jobilize.com Reply

### Read also:

#### Get the best Algebra and trigonometry course in your pocket!

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 Qqq Qqq  By   By Anindyo Mukhopadhyay    