An Efficient flexible common operator for FFT and Viterbi Algorithms - CentraleSupélec Access content directly
Conference Papers Year : 2011

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.
No file

Dates and versions

hal-00657436 , version 1 (06-01-2012)

Identifiers

Cite

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⟩
337 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More