Implementation techniques of high-order FFT into low-cost FPGA - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Implementation techniques of high-order FFT into low-cost FPGA

Yousri Ouerhani
  • Fonction : Auteur
  • PersonId : 936204
Maher Jridi
Ayman Alfalou

Résumé

In this paper, our objective is to detail know-how and techniques that can help the designer of electronic circuits to develop and to optimize their own IP in a reasonable time. For this reason, we propose to optimize existing FFT algorithms for low-cost FPGA implementations. For that, we have used short length structures to obtain higher length transforms. Indeed, we can obtain a VLSI structure by using log4 (N) 4-point FFTs to construct N-point FFT rather than (N/8) log8 (N) 8-point FFTs. Furthermore, two techniques are used to yield with VLSI architecture. Firstly, the radix-4 FFT is modified to process one sample per clock cycle. Secondly, the memory is shared and divided into 4 parts to reduce the consumed resources and to improve the overall latency. Comparisons with commercial IP cores show that the low area architecture presents the best compromise in terms of speed/area
Fichier principal
Vignette du fichier
MWSCAS-Yousri.pdf (319.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00783028 , version 1 (31-01-2013)

Identifiants

  • HAL Id : hal-00783028 , version 1

Citer

Yousri Ouerhani, Maher Jridi, Ayman Alfalou. Implementation techniques of high-order FFT into low-cost FPGA. IEEE 54th International Midwest Symposium on Circuits and Systems (MWSCAS), 2011, Aug 2011, North Korea. pp.1-4. ⟨hal-00783028⟩

Collections

LABISEN
46 Consultations
1227 Téléchargements

Partager

Gmail Facebook X LinkedIn More