A Continuous-Flow Memory-Based Architecture for Real-Valued FFT

This brief proposes a continuous-flow memory-based architecture for fast Fourier transform (FFT) computation for real-valued signals. The proposed architecture is based on a modified radix-2 algorithm, which removes redundant operations to reduce resource usage. A new data-flow graph and address mapping scheme are proposed that satisfy the requirement of continuous-flow operation and minimize the memory usage. The proposed processing element takes advantage of pipelined FFT architectures to avoid bank conflicts in each stage. Compared with prior works, the proposed design has the advantage of supporting continuous-flow operation and normal-order output while minimizing the resource usage.

[1]  Myung Hoon Sunwoo,et al.  New continuous-flow mixed-radix (CFMR) FFT Processor using novel in-place strategy , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[2]  Oscar Gustafsson,et al.  The Serial Commutator FFT , 2016, IEEE Transactions on Circuits and Systems II: Express Briefs.

[3]  Peter Liu,et al.  Minimizing the memory requirement for continuous flow FFT implementation: continuous flow mixed mode FFT (CFMM-FFT) , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[4]  Keshab K. Parhi,et al.  FFT Architectures for Real-Valued Signals Based on Radix-$2^{3}$ and Radix-$2^{4}$ Algorithms , 2013, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5]  Pei-Yun Tsai,et al.  A Generalized Conflict-Free Memory Addressing Scheme for Continuous-Flow Parallel-Processing FFT Processors With Rescheduling , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[6]  Chen-Yi Lee,et al.  A Generalized Mixed-Radix Algorithm for Memory-Based FFT Processors , 2010, IEEE Transactions on Circuits and Systems II: Express Briefs.

[7]  Jesús Grajal,et al.  A 4096-Point Radix-4 Memory-Based FFT Using DSP Slices , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Keshab K. Parhi,et al.  A Pipelined FFT Architecture for Real-Valued Signals , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

[9]  Feng Yu,et al.  A Novel Memory-Based FFT Architecture for Real-Valued Signals Based on a Radix-2 Decimation-In-Frequency Algorithm , 2015, IEEE Transactions on Circuits and Systems II: Express Briefs.

[10]  Keshab K. Parhi,et al.  An In-Place FFT Architecture for Real-Valued Signals , 2013, IEEE Transactions on Circuits and Systems II: Express Briefs.

[11]  K. Parhi,et al.  Parallel - pipelined radix-22 FFT architecture for real valued signals , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.

[12]  Feng Yu,et al.  Pipelined Architecture for a Radix-2 Fast Walsh–Hadamard–Fourier Transform Algorithm , 2015, IEEE Transactions on Circuits and Systems II: Express Briefs.

[13]  Hsiang-Feng Chi,et al.  A cost-effective memory-based real-valued FFT and Hermitian symmetric IFFT processor for DMT-based wire-line transmission systems , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[14]  Lewis Johnson,et al.  Conflict free memory addressing for dedicated FFT hardware , 1992 .