Skip to Main content Skip to Navigation
Conference papers

An Efficient flexible common operator for FFT and Viterbi Algorithms

Abstract : 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.
Complete list of metadata
Contributor : Anne Cloirec Connect in order to contact the contributor
Submitted on : Friday, January 6, 2012 - 3:37:26 PM
Last modification on : Thursday, January 20, 2022 - 12:54:06 PM



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⟩



Les métriques sont temporairement indisponibles