A Modified Signal Flow Graph and Corresponding Conflict-Free Strategy for Memory-Based FFT Processor Design

This brief presents a modified radix-4 fast Fourier transform (FFT) signal flow graph, whose input and output both are in natural order. Compared with the conventional radix-4 signal flow graph, it does not buffer the result of the last stage or execute the bit-reverse operation to generate the result, but generates the result directly in the last stage. Thus, the number of iterations is reduced by one. In order to realize the proposed memory-based FFT processor by using the modified radix-4 FFT signal flow graph, a conflict-free strategy and corresponding memory-addressing scheme is proposed. At last, the hardware implementation for the proposed FFT processor is proposed. Through the adoption of this method, FFT processor of arbitrary point conforming to the radix-4 algorithm can be implemented. Compared with the previous memory-based FFT processors, the proposed FFT processor has less processing time under similar or lower resource consumption.

[1]  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.

[2]  Bin Wu,et al.  A Memory-Based FFT Processor Design With Generalized Efficient Conflict-Free Address Schemes , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[3]  Yi-Jun Liu,et al.  Efficient Memory-Addressing Algorithms for FFT Processor Design , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[4]  Qian-Jian Xing,et al.  A Novel Conflict-Free Parallel Memory Access Scheme for FFT Processors , 2017, IEEE Transactions on Circuits and Systems II: Express Briefs.

[5]  Qian-Jian Xing,et al.  A Continuous-Flow Memory-Based Architecture for Real-Valued FFT , 2017, IEEE Transactions on Circuits and Systems II: Express Briefs.

[6]  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.

[7]  Feng Yu,et al.  Resource-Efficient Pipelined Architectures for Radix-2 Real-Valued FFT With Real Datapaths , 2016, IEEE Transactions on Circuits and Systems II: Express Briefs.

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

[9]  Qi Shen,et al.  A memory-based FFT processor using modified signal flow graph with novel conflict-free address schemes , 2017, IEICE Electron. Express.

[10]  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.

[11]  Martin Margala,et al.  Low-Power Split-Radix FFT Processors Using Radix-2 Butterfly Units , 2016, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.