An Area-Energy-Efficient 64–2048 Point FFT With Approximate Plane-Fitting Complex Multipliers
An Area-Energy-Efficient 64–2048 Point FFT With Approximate Plane-Fitting Complex Multipliers
Abstract:
As a key component of fast Fourier transform (FFT), the complex multiplier (CM) includes twiddle factor generation and corresponding multiplication. This brief proposes an tailored approach for approximating CM functionality by employing an adapted piecewise-plane-fitting technique, effectively replacing the conventional look-up-table-based twiddle generation and exact multipliers by shift-and-add calculation. Numerous binary calculation and optimizations are conducted to achieve an optimal tradeoff among accuracy, circuit complexity, power, and delay. Based on 28-nm CMOS, logic synthesis results demonstrate significant improvements. The proposed approach yields delay reductions of 64.18%, 64.98%, and 19.71%, respectively. With optimizations on logic structures, the completed design of the 64–2048 point FFT has efficiently adopted the proposed CM with efficiency gains. The proposed FFT outperforms other reconfigurable FFT designs in terms of normalized area reduction over 55.3% and normalized energy improvement over 215.1%. In field-programmable gate array (FPGA) implementation, the proposed FFT has significantly more savings compared with the exact FFT. In practice, the approximate FFT output results’ PSNR ranges from 56 to 63 dB with competent accuracy in typical signal processing.
Index Terms —
Approximate complex multiplier (CM), approximate computing, fast Fourier transform (FFT), piecewise-plane fitting, twiddle factor.
” Thanks for Visit this project Pages – Register This Project and Buy soon with Novelty “
