Radix $r^{k} $ FFTs: Matricial Representation and SDC/SDF Pipeline Implementation
This paper proposes to use the discrete Fourier transform (DFT) matrix factorization based on the Kronecker product to express the family of radix <i>rk</i> single-path delay commutator/single-path delay feedback (SDC/SDF) pipeline fast Fourier transform (FFT) architectures. The matricial expressions of the radix <i>r</i>, <i>r</i> <sup>2</sup>, <i>r</i> <sup>3</sup>, and <i>r</i> <sup>4</sup> decimation-in-frequency (DIF) SDC/SDF pipeline architectures are derived. These expressions can be written using a small set of operators, resulting in a compact representation of the algorithms. The derived expressions are general in terms of <i>r</i> and the number of points of the FFT <i>N</i>. Expressions are given where it is not necessary that <i>N</i> is a power of <i>rk</i>. The proposed set of operators can be mapped to equivalent hardware circuits. Thus, the designer can easily go from the matricial representations to their implementations and vice versa. As an example, the mapping of the operators is shown for radix 2, 2<sup>2</sup>, 2<sup>3</sup>, and 2<sup>4</sup>, and the details of the corresponding SDC/SDF pipeline FFT architectures are presented. Furthermore, a general expression is given for the SDC/SDF radix <i>rk</i> pipeline architectures when <i>k</i> > 4. This general expression helps the designer to efficiently handle a wider design exploration space and select the optimum single-path architecture for a given value of <i>N</i>.