<< Chapter < Page Chapter >> Page >

Programs for circular convolution

To write a program that computes the circular convolution of h and x using the bilinear form Equation 24 in Bilinear Forms for Circular Convolution we need subprograms that carry out the action of P , P t , R , R t , A and B t . We are assuming, as is usually done, that h is fixed and known so that u = C t R - t P J h can be pre-computed and stored. To compute these multiplicative constants u we need additional subprograms to carry out the action of C t and R - t but the efficiency with which we compute u is unimportant since this is done beforehand and u is stored.

In Prime Factor Permutations we discussed the permutation P and a program for it pfp() appears in the appendix. The reduction operations R , R t and R - t we have described in Reduction Operations and programs for these reduction operations KRED() etc, also appear in the appendix. To carry out the operation of A and B t we need to be able to carry out the action of A d 1 A d k and this was discussed in Implementing Kronecker Products Efficiently . Note that since A and B t are block diagonal, each diagonal block can be done separately.However, since they are rectangular, it is necessary to be careful so that the correct indexing is used.

To facilitate the discussion of the programs we generate, it is useful to consider an example.Take as an example the 45 point circular convolution algorithm listed in the appendix.From Equation 19 from Bilinear Forms for Circular Convolution we find that we need to compute x = P 9 , 5 x and x = R 9 , 5 x . These are the first two commands in the program.

We noted above that bilinear forms for linear convolution, ( D d , E d , F d ) , can be used for these cyclotomic convolutions.Specifically we can take A p i = D φ ( p i ) , B p i = E φ ( p i ) and C p i = G p i F φ ( p i ) . In this case Equation 20 in Bilinear Forms for Circular Convolution becomes

A = 1 D 2 D 6 D 4 ( D 2 D 4 ) ( D 6 D 4 ) .

In our approach this is what we have done. When we use the bilinear forms for convolution givenin the appendix, for which D 4 = D 2 D 2 and D 6 = D 2 D 3 , we get

A = 1 D 2 ( D 2 D 3 ) ( D 2 D 2 ) ( D 2 D 2 D 2 ) ( D 2 D 3 D 2 D 2 )

and since E d = D d for the linear convolution algorithms listed in the appendix,we get

B = 1 D 2 t ( D 2 t D 3 t ) ( D 2 t D 2 t ) ( D 2 t D 2 t D 2 t ) ( D 2 t D 3 t D 2 t D 2 t ) .

From the discussion above, we found that the Kronecker products like D 2 D 2 D 2 appearing in these expressions are best carried out by factoring the product in to factorsof the form I a D 2 I b . Therefore we need a program to carry out ( I a D 2 I b ) x and ( I a D 3 I b ) x . These function are called ID2I(a,b,x) and ID3I(a,b,x) and are listed in the appendix. The transposed form, ( I a D 2 t I b ) x , is called ID2tI(a,b,x) .

To compute the multiplicative constants we need C t . Using C p i = G p i F φ ( p i ) we get

C t = 1 F 2 t G 3 t F 6 t G 9 t F 4 t G 5 t ( F 2 t G 3 t F 4 t G 5 t ) ( F 6 t G 9 t F 4 t G 5 t ) = 1 F 2 t G 3 t F 6 t G 9 t F 4 t G 5 t ( F 2 t F 4 t ) ( G 3 t G 5 t ) ( F 6 t F 4 t ) ( G 9 t G 5 t ) .

The Matlab function KFt carries out the operation F d 1 F d K . The Matlab function Kcrot implements the operation G p 1 e 1 G p K e K . They are both listed in the appendix.

Common functions

By recognizing that the convolution algorithms for different lengths share a lot of the same computations, it is possibleto write a set of programs that take advantage of this. The programs we have generated call functions from a relativessmall set. Each program calls these functions with different arguments,in differing orders, and a different number of times. By organizing the program structure in a modular way,we are able to generate relatively compact code for a wide variety of lengths.

In the appendix we have listed code for the following functions, from which we create circular convolution algorithms.In the next section we generate FFT programs using this same set of functions.

  • The Matlab function pfp implements this permutation of Prime Factor Permutations . Its transpose is implemented by pfpt .
  • The Matlab function KRED implements the reduction operations of Reduction Operations . Its transpose is implemented by tKRED . Its inverse transpose is implemented by itKRED and this function is used only for computing the multiplicative constants.
  • ID2I and ID3I are Matlab functions for the operations I D 2 I and I D 3 I . These linear convolution operations are also described in the appendix`Bilinear Forms for Linear Convolution.' ID2tI and ID3tI implement the transposes, I D 2 t I and I D 3 t I .

Operation counts

[link] lists operation counts for some of the circular convolution algorithms we have generated.The operation counts do not include any arithmetic operations involved in the index variable or loops.They include only the arithmetic operations that involve the data sequence x in the convolution of x and h .

The table in [link] for the split nesting algorithm gives very similar arithmetic operation counts.For all lengths not divisible by 9, the algorithms we have developed use the same number of multiplications and the same number or fewer additions.For lengths which are divisible by 9, the algorithms described in [link] require fewer additions than do ours. This is because the algorithms whose operation counts aretabulated in the table in [link] use a special Φ 9 ( s ) convolution algorithm. It should be noted, however, that the efficient Φ 9 ( s ) convolution algorithm of [link] is not constructed from smaller algorithms using the Kronecker product, as is ours.As we have discussed above, the use of the Kronecker product facilitates adaptation to special computer architectures andyields a very compact program with function calls to a small set of functions.

Operation counts for split nesting circular convolution algorithms
N muls adds N muls adds N muls adds N muls adds
2 2 4 24 56 244 80 410 1546 240 1640 6508
3 4 11 27 94 485 84 320 1712 252 1520 7920
4 5 15 28 80 416 90 380 1858 270 1880 9074
5 10 31 30 80 386 105 640 2881 280 2240 9516
6 8 34 35 160 707 108 470 2546 315 3040 13383
7 16 71 36 95 493 112 656 2756 336 2624 11132
8 14 46 40 140 568 120 560 2444 360 2660 11392
9 19 82 42 128 718 126 608 3378 378 3008 16438
10 20 82 45 190 839 135 940 4267 420 3200 14704
12 20 92 48 164 656 140 800 3728 432 3854 16430
14 32 170 54 188 1078 144 779 3277 504 4256 19740
15 40 163 56 224 1052 168 896 4276 540 4700 21508
16 41 135 60 200 952 180 950 4466 560 6560 25412
18 38 200 63 304 1563 189 1504 7841 630 6080 28026
20 50 214 70 320 1554 210 1280 6182 720 7790 30374
21 64 317 72 266 1250 216 1316 6328 756 7520 38144

It is possible to make further improvements to the operation counts given in [link] [link] , [link] . Specifically, algorithms for prime power cyclotomic convolutionbased on the polynomial transform, although more complicated, will give improvements for the longer lengths listed [link] , [link] . These improvements can be easily included in the code generatingprogram we have developed.

Questions & Answers

what is mutation
Janga Reply
what is a cell
Sifune Reply
how is urine form
Sifune
what is antagonism?
mahase Reply
classification of plants, gymnosperm features.
Linsy Reply
what is the features of gymnosperm
Linsy
how many types of solid did we have
Samuel Reply
what is an ionic bond
Samuel
What is Atoms
Daprince Reply
what is fallopian tube
Merolyn
what is bladder
Merolyn
what's bulbourethral gland
Eduek Reply
urine is formed in the nephron of the renal medulla in the kidney. It starts from filtration, then selective reabsorption and finally secretion
onuoha Reply
State the evolution relation and relevance between endoplasmic reticulum and cytoskeleton as it relates to cell.
Jeremiah
what is heart
Konadu Reply
how is urine formed in human
Konadu
how is urine formed in human
Rahma
what is the diference between a cavity and a canal
Pelagie Reply
what is the causative agent of malaria
Diamond
malaria is caused by an insect called mosquito.
Naomi
Malaria is cause by female anopheles mosquito
Isaac
Malaria is caused by plasmodium Female anopheles mosquitoe is d carrier
Olalekan
a canal is more needed in a root but a cavity is a bad effect
Commander
what are pathogens
Don Reply
In biology, a pathogen (Greek: πάθος pathos "suffering", "passion" and -γενής -genēs "producer of") in the oldest and broadest sense, is anything that can produce disease. A pathogen may also be referred to as an infectious agent, or simply a germ. The term pathogen came into use in the 1880s.[1][2
Zainab
A virus
Commander
Definition of respiration
Muhsin Reply
respiration is the process in which we breath in oxygen and breath out carbon dioxide
Achor
how are lungs work
Commander
where does digestion begins
Achiri Reply
in the mouth
EZEKIEL
what are the functions of follicle stimulating harmones?
Rashima Reply
stimulates the follicle to release the mature ovum into the oviduct
Davonte
what are the functions of Endocrine and pituitary gland
Chinaza
endocrine secrete hormone and regulate body process
Achor
while pituitary gland is an example of endocrine system and it's found in the Brain
Achor
what's biology?
Egbodo Reply
Biology is the study of living organisms, divided into many specialized field that cover their morphology, physiology,anatomy, behaviour,origin and distribution.
Lisah
biology is the study of life.
Alfreda
Biology is the study of how living organisms live and survive in a specific environment
Sifune
Got questions? Join the online conversation and get instant answers!
Jobilize.com Reply

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Automatic generation of prime length fft programs. OpenStax CNX. Sep 09, 2009 Download for free at http://cnx.org/content/col10596/1.4
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Automatic generation of prime length fft programs' conversation and receive update notifications?

Ask