Circuits, Systems, and Signal Processing
An Adaptation of the Fast Fourier Transform for Parallel Processing
Journal of the ACM (JACM)
A New Approach to Pipeline FFT Processor
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Tensor product algebra as a tool for VLSI implementation of the discrete Fourier transform
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
The Design of a Class of Fast Fourier Transform Computers
IEEE Transactions on Computers
Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations
IEEE Transactions on Computers
An FFT core for DVB-T/DVB-H receivers
VLSI Design
Formal datapath representation and manipulation for implementing DSP transforms
Proceedings of the 45th annual Design Automation Conference
New efficient FFT algorithm and pipeline implementation results for OFDM/DMT applications
IEEE Transactions on Consumer Electronics
Analysis of twiddle factor memory complexity of radix-2ipipelined FFTs
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Computer Generation of Hardware for Linear Digital Signal Processing Transforms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Pipelined radix-2k feedforward FFT architectures
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A high-speed low-complexity modified radix - 25 FFT processor for high rate WPAN applications
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
MDC FFT/IFFT processor with variable length for MIMO-OFDM systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 35.68 |
This paper proposes to use the discrete Fourier transform (DFT) matrix factorization based on the Kronecker product to express the family of radix rk single-path delay commutator/ single-path delay feedback (SDC/SDF) pipeline fast Fourier transform (FFT) architectures. The matricial expressions of the radix r, r2, r3, and r4 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 r and the number of points of the FFT N. Expressions are given where it is not necessary that N is a power of rk. 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, 22, 23, and 24, and the details of the corresponding SDC/SDF pipeline FFT architectures are presented. Furthermore, a general expression is given for the SDC/SDF radix rk pipeline architectures when k 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 N.