An Efficient flexible common operator for FFT and Viterbi Algorithms

Malek Naoues , Dominique Noguet (1) , Yves Louët (2) , Khaled Grati (3) , Adel Ghazel (4)

1 CEA-LETI - Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information
2 IETR - Institut d'Électronique et des Technologies du numéRique
3 LTCI - Laboratoire Traitement et Communication de l'Information
4 SUP'COM

Today's telecommunication systems require more and more flexibility, and reconfiguration mechanisms are becoming major topics especially when it comes to multi-standard designs. This paper capitalizes on the Common Operator technique to present a new common operator for the FFT and Viterbi algorithms. In the present work, the FFT/Viterbi common butterfly is investigated where reuse and power consumption is traded against throughput. Performance comparisons with similar works are discussed in this paper.

Mots clés: FFT; Viterbi; Common operator

Domaines: Traitement du signal et de l'image [eess.SP]; Traitement du signal et de l'image [eess.SP]

Malek Naoues, Dominique Noguet, Yves Louët, Khaled Grati, Adel Ghazel. An Efficient flexible common operator for FFT and Viterbi Algorithms. C2POWER Workshop - VTC 2011, May 2011, Budapest, Hungary. pp.1-5, ⟨10.1109/VETECS.2011.5956658⟩. ⟨hal-00657436⟩