Dynamic Partial Reconfigurable FFT for OFDM Based Communication Systems

Abstract

This paper presents a novel scalable and runtime dynamically reconfigurable FFT architecture for different wireless standards. With only 8 butterfly units, a reconfigurable FFT architecture for three different FFT points is realized using mixed radix-2 2 /2 3 /2 4 FFT algorithm in a modified Single-path Delay Feedback (SDF) pipelined architecture. Via a proper data flow reconfiguration it can support 64, 128 and 256. It can even be extended up to 8192-point transforms and uses only 13 butterfly units to realize 8192 points. This paper describes the implementation method of 256 and 128 point FFT, which is reconfigured partially from 64 point FFT. The whole system is implemented on a Xilinx XC2VP30 FPGA device. The implementation design addresses area efficiency and flexibility allowing the insertion of the partial modules dynamically to realize various FFT sizes. To verify the efficacy of this dynamic partial reconfigurable FFT design method, a conventional multiplexer based reconfigurable architecture was designed and tested on the same platform. Tested FPGA results for the Dynamic Partial Reconfigurable (DPR) method show the configuration time improvement and good area efficiency as compared to the reconfigurable architecture using conventional multiplexer techniques.

Versatile digital architecture for mobile terminal

“…The most used is the pipeline architecture which is best choice to implement high-speed long size FFT. Moreover, it can achieve high-throughput and has a regular structure and relatively simple control [23,24]. Several pipelined architectures have been developed, such as multi-path delay commutator (MDC) [25], single path delay feedback (SDF) [17,25], and single path delay commutator (SDC).…”

8-Point RADIX-8 Pipelined FFT Using SDF

“…For a same number if base increases the power will reduce. FFT algorithms using higher radix can be designed by decomposition of the frequency domain samples into more groups at the cost of more complicated control.A radix-8 butterfly can also be realized by cascading three radix-2 stages, which is called radix-2 3 algorithm. Radix-r FFT can easily derived from DFT by decomposing the N point DFT into a set of recursively related r-point transform and x(n) is power of r. In Radix-8 algorithm the r is 8.…”

Implementation of universal digital architecture using 3D-NoC for mobile terminal

“…The most used is the pipeline architecture which is best choice to implement high-speed long size FFT. Moreover, it also can achieve high-throughput and has a regular structure [25,26]. Several pipelined architectures have been developed, such as multi-path delay commutator (MDC) [26], single path delay feedback (SDF) [20,26], and single path delay commutator (SDC).…”

“…Moreover, it also can achieve high-throughput and has a regular structure [25,26]. Several pipelined architectures have been developed, such as multi-path delay commutator (MDC) [26], single path delay feedback (SDF) [20,26], and single path delay commutator (SDC). Considering these previous works, the SDF pipeline architecture can be easily scaled and parameterized in hardware design [20,26].…”

“…Several pipelined architectures have been developed, such as multi-path delay commutator (MDC) [26], single path delay feedback (SDF) [20,26], and single path delay commutator (SDC). Considering these previous works, the SDF pipeline architecture can be easily scaled and parameterized in hardware design [20,26]. Therefore, a pipeline architecture allows for 8 to 8192-points FFT by adding several processing element (PE) can be proposed [27].…”