FPGA implementation for the multiplexed and pipelined building blocks of higher Radix-2k FFT

Massicotte, D., Jaber, M. A., Neili, C. et Ahmed Ouameur, M. (2020, February 25-28). FPGA implementation for the multiplexed and pipelined building blocks of higher Radix-2k FFT. Dans 2020 IEEE 11th Latin American Symposium on Circuits & Systems (LASCAS), San Jose, Costa Rica DOI 10.1109/LASCAS45839.2020.9069029.

Prévisualisation

PDF Télécharger (408kB) | Prévisualisation

Résumé

Fast Fourier transform (FFT) is one of the fundamental processing block used in many signal processing applications (i.e. for orthogonal frequency division multiplexing in wireless telecommunication). Therefore, every proposal to reduced latency, resources or accuracy errors of FFT implementation counts. This paper proposes the implementation of the butterfly processing elements (BPE) where the concept of the radix-r butterfly computation has been formulated as the combination of α radix-2 butterflies implemented in parallel. An efficient FFT implementation is feasible using our proposed multiplexed and pipelined BPE. Compared to a state-of-the-art reference based on pipelined and parallel structure FFTs, and FPGA based implementation reveals that the maximum throughput is improved by a factor of 1.3 for a 256-point FFT and reach a throughput of 2680 MSps on Virtex-7. The analysis extends to touch on key performance measurements metrics such as throughput, latency and resource utilization.

Type de document:	Document issu d'une conférence ou d'un atelier
Date de dépôt:	09 mai 2022 19:14
Dernière modification:	09 mai 2022 19:14
URI:	https://depot-e.uqtr.ca/id/eprint/10137

Actions (administrateurs uniquement)

Éditer la notice