A generalized conflict-free address scheme for arbitrary 2k-point memory-based FFT processors
Xia Kaifeng, Bin Wu, Xiaoping Zhou, Tao Xiong · 2016
This paper presents an efficient conflict-free memory address scheme for arbitrary 2k-point memory-based FFT processors. The address scheme can support in-place strategy, continuous-flow mode, and variable size for arbitrary long sized FFT. More over, the address scheme can adjust the throughput by changing the computation radix and the parallelism of the arithmetic processing units according to the specific implementation requirements. We have designed a configurable 128 — 2048 point FFT processor for LTE system. From the results, we can see the proposed address scheme has excellent point flexibility, hardware efficiency, and can support almost any 2k-point FFT implementations.