An Efficient Flexible Common Operator for FFT and Viterbi Algorithms
Malek Naoues, Dominique Noguet, Yves Louët, Khaled Grati, Adel Ghazel · 2011
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.