The Serial Commutator ( SC ) FFT

This paper presents a new type of FFT hardware architectures called serial commutator (SC) FFT. The SC FFT is characterized by the use of circuits for bit-dimension permutation of serial data. The proposed architectures are based on the observation that in the radix-2 FFT algorithm only half of the samples at each stage must be rotated. This fact, together with a proper data management makes it possible to allocate rotations only every other clock cycle. This allows for simplifying the rotator, halving the complexity with respect to conventional serial FFT architectures. Likewise, the proposed approach halves the number of adders in the butterflies with respect to previous architectures. As a result, the proposed architectures use the minimum number of adders, rotators and memory that are necessary for a pipelined FFT of serial data, with 100% utilization ratio.

[1]  Yun-Nan Chang,et al.  An Efficient VLSI Architecture for Normal I/O Order Pipeline FFT Design , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.

[2]  Shousheng He,et al.  Design and implementation of a 1024-point pipeline FFT processor , 1998, Proceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143).

[3]  Yun-Nan Chang.  Design of an 8192-point Sequential I / O FFT Chip , 2012 .

[4]  Oscar Gustafsson,et al.  A 512-point 8-parallel pipelined feedforward FFT for WPAN , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[5]  Feng Yu,et al.  A pipelined architecture for normal I/O order FFT , 2011, Journal of Zhejiang University SCIENCE C.

[6]  Jesús Grajal,et al.  Optimum Circuits for Bit Reversal , 2011, IEEE Transactions on Circuits and Systems II: Express Briefs.

[7]  Bingsheng He,et al.  A Combined SDC-SDF Architecture for Normal I/O Pipelined Radix-2 FFT , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Alvin M. Despain,et al.  Fourier Transform Computers Using CORDIC Iterations , 1974, IEEE Transactions on Computers.

[9]  Chih-Peng Fan,et al.  A Low Multiplier and Multiplication Costs 256-point FFT Implementation with Simplified Radix-24 SDF Architecture , 2006, APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems.

[10]  Viktor Öwall,et al.  Architectures for Dynamic Data Scaling in 2/4/8K Pipeline FFT Cores , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  Chein-Wei Jen,et al.  High-speed and low-power split-radix FFT , 2003, IEEE Trans. Signal Process..

[12]  M. Lopez-Vallejo,et al.  Implementing FFT-based digital channelized receivers on FPGA platforms , 2008, IEEE Transactions on Aerospace and Electronic Systems.

[13]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[14]  E. V. Jones,et al.  A pipelined FFT processor for word-sequential data , 1989, IEEE Trans. Acoust. Speech Signal Process..

[15]  Liang Yang,et al.  An efficient locally pipelined FFT processor , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[16]  Jesús Grajal,et al.  Pipelined Radix-$2^{k}$ Feedforward FFT Architectures , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[17]  Ade Irawan,et al.  64-point fast efficient FFT architecture using Radix-23 single path delay feedback , 2009, 2009 International Conference on Electrical Engineering and Informatics.