<< Chapter < Page Chapter >> Page >
s N - 1 = ( s M ) 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 C [ s ] / ( s N - 1 ) , 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] :

C [ s ] / ( s N - 1 ) = C [ x ] / ( ( s M ) K - 1 ) 0 i < K C [ s ] / ( s M - W K i )
0 i < K 0 j < M C [ s ] / ( x - W N j K + i )
0 i < N C [ s ] / ( x - W N i ) .

As bases in the smaller algebras C [ s ] / ( s M - W K i ) we choose c i = ( 1 , s , , s M - 1 ) . 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 mod ( s M - W K i ) , 0 n < N . To do so, we decompose the index n as n = M + m and compute

s n = s M + m = ( s M ) s m W k m s m mod ( s M - W K i ) .

This shows that the matrix for [link] is given by DFT K I M .

In step [link] , each C [ s ] / ( s M - W K i ) is completely decomposed by its polynomial transform

DFT M ( i , K ) = DFT M · diag 0 i < M ( W N i j ) .

At this point, C [ s ] / ( s N - 1 ) is completely decomposed, but the spectrum is ordered according to j K + i , 0 i < M , 0 j < K ( j runs faster). The desired order is i M + j .

Thus, in step [link] , we need to apply the permutation j K + i i M + 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:

L M N 0 i < K DFT M · diag j = 0 M - 1 ( W N i j ) ( DFT k I M ) = L M N ( I K DFT M ) T M N ( DFT k I M ) .

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

( DFT k I M ) T M N ( I K DFT M ) 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 C [ x ] / ( s N - 1 ) = C [ C N ] 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 A and the set of signals an associated A -module M . ASP then builds a signal processing theory formally from the axiomaticdefinition of a signal model : a triple ( A , M , Φ ) , where Φ generalizes the idea of the z -transform to mappings from vector spaces of signal values to 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 C n C [ s ] / ( s n - 1 ) .

Infinite and finite time models as defined in ASP.
Signal model Infinite time Finite time
A n Z H ( n ) s n ( , H ( - 1 ) , H ( 0 ) , H ( 1 ) , ) 1 ( Z ) C [ x ] / ( s n - 1 )
M n Z X ( n ) s n ( , X ( - 1 ) , X ( 0 ) , X ( 1 ) , ) 2 ( Z ) C [ s ] / ( s n - 1 )
Φ Φ : 2 ( Z ) M Φ : C n 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

where we get a research paper on Nano chemistry....?
Maira Reply
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..
Even nanotechnology is pretty much all about chemistry... Its the chemistry on quantum or atomic level
no nanotechnology is also a part of physics and maths it requires angle formulas and some pressure regarding concepts
Preparation and Applications of Nanomaterial for Drug Delivery
Hafiz Reply
Application of nanotechnology in medicine
what is variations in raman spectra for nanomaterials
Jyoti Reply
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.
yes that's correct
I think
Nasa has use it in the 60's, copper as water purification in the moon travel.
nanocopper obvius
what is the stm
Brian Reply
is there industrial application of fullrenes. What is the method to prepare fullrene on large scale.?
industrial application...? mmm I think on the medical side as drug carrier, but you should go deeper on your research, I may be wrong
How we are making nano material?
what is a peer
What is meant by 'nano scale'?
What is STMs full form?
scanning tunneling microscope
how nano science is used for hydrophobicity
Do u think that Graphene and Fullrene fiber can be used to make Air Plane body structure the lightest and strongest. Rafiq
what is differents between GO and RGO?
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
analytical skills graphene is prepared to kill any type viruses .
Any one who tell me about Preparation and application of Nanomaterial for drug Delivery
what is Nano technology ?
Bob Reply
write examples of Nano molecule?
The nanotechnology is as new science, to scale nanometric
nanotechnology is the study, desing, synthesis, manipulation and application of materials and functional systems through control of matter at nanoscale
Is there any normative that regulates the use of silver nanoparticles?
Damian Reply
what king of growth are you checking .?
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
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
what school?
biomolecules are e building blocks of every organics and inorganic materials.
Got questions? Join the online conversation and get instant answers!
Jobilize.com Reply

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?