0.6 Winograd's short dft algorithms  (Page 90/11)

In 1976, S. Winograd [link] presented a new DFT algorithm which had significantly fewer multiplications than the Cooley-TukeyFFT which had been published eleven years earlier. This new Winograd Fourier Transform Algorithm (WFTA) is based on the type- one indexmap from Multidimensional Index Mapping with each of the relatively prime length short DFT's calculated by very efficient special algorithms. It isthese short algorithms that this section will develop. They use the index permutation of Rader described in the another module toconvert the prime length short DFT's into cyclic convolutions. Winograd developed a method for calculating digital convolution withthe minimum number of multiplications. These optimal algorithms are based on the polynomial residue reduction techniques of Polynomial Description of Signals: Equation 1 to break the convolution into multiple small ones [link] , [link] , [link] , [link] , [link] , [link] .

The operation of discrete convolution defined by

is called a bilinear operation because, for a fixed $h\left(n\right)$ , $y\left(n\right)$ is a linear function of $x\left(n\right)$ and for a fixed $x\left(n\right)$ it is a linear function of $h\left(n\right)$ . The operation of cyclic convolution is the same but with all indices evaluated modulo $N$ .

Recall from Polynomial Description of Signals: Equation 3 that length-N cyclic convolution of $x\left(n\right)$ and $h\left(n\right)$ can be represented by polynomial multiplication

This bilinear operation of [link] and [link] can also be expressed in terms of linear matrix operators and a simpler bilinearoperator denoted by $o$ which may be only a simple element-by-element multiplication of the two vectors [link] , [link] , [link] . This matrix formulation is

where $X$ , $H$ and $Y$ are length-N vectors with elements of $x\left(n\right)$ , $h\left(n\right)$ and $y\left(n\right)$ respectively. The matrices $A$ and $B$ have dimension $M$ x $N$ , and $C$ is $N$ x $M$ with $M\ge N$ . The elements of $A$ , $B$ , and $C$ are constrained to be simple; typically small integers or rational numbers. It will be thesematrix operators that do the equivalent of the residue reduction on the polynomials in [link] .

In order to derive a useful algorithm of the form [link] to calculate [link] , consider the polynomial formulation [link] again. To use the residue reduction scheme, the modulus is factored into relatively prime factors. Fortunately the factoringof this particular polynomial, $s^N-1$ , has been extensively studied and it has considerable structure. When factored over the rationals,which means that the only coefficients allowed are rational numbers, the factors are called cyclotomic polynomials [link] , [link] , [link] . The most interesting property for our purposes is that most of the coefficients of cyclotomic polynomialsare zero and the others are plus or minus unity for degrees up to over one hundred. This means the residue reduction will generallyrequire no multiplications.

The operations of reducing $X\left(s\right)$ and $H\left(s\right)$ in [link] are carried out by the matrices $A$ and $B$ in [link] . The convolution of the residue polynomials is carried out by the $o$ operator and the recombination by the CRT is done by the $C$ matrix. More details are in [link] , [link] , [link] , [link] , [link] but the important fact is the $A$ and $B$ matrices usually contain only zero and plus or minus unity entries and the $C$ matrix only contains rational numbers. The only general multiplications are those represented by $o$ . Indeed, in the theoretical results from computational complexity theory,these real or complex multiplications are usually the only ones counted. In practical algorithms, the rational multiplicationsrepresented by $C$ could be a limiting factor.