A new computational decoding complexity measure of convolutional codes

作者：Benchimol Isaac B; Pimentel Cecilio^*; Souza Richard Demo; Uchoa Filho Bartolomeu F

来源：EURASIP Journal on Advances in Signal Processing, 2014, 2014(1): 173.

DOI：10.1186/1687-6180-2014-173

• Convolutional codes
• Computational complexity
• Decoding complexity
• Distance spectrum
• Trellis module
• Viterbi algorithm

This paper presents a computational complexity measure of convolutional codes well suitable for software implementations of the Viterbi algorithm (VA) operating with hard decision. We investigate the number of arithmetic operations performed by the decoding process over the conventional and minimal trellis modules. A relation between the complexity measure defined in this work and the one defined by McEliece and Lin is investigated. We also conduct a refined computer search for good convolutional codes (in terms of distance spectrum) with respect to two minimal trellis complexity measures. Finally, the computational cost of implementation of each arithmetic operation is determined in terms of machine cycles taken by its execution using a typical digital signal processor widely used for low-power telecommunications applications.

• 出版日期2014-12-4