A Computational Complexity Measure for Trellis Modules of Convolutional Codes

被引：0
|
作者：
Benchimol, Isaac B. [1 ]
Pimentel, Cecilio [2 ]
Souza, Richard Demo [3 ]
Uchoa-Filho, Bartolomeu F. [4 ]
机构：
[1] Fed Inst Amazonas IFAM, CMDI, Manaus, Amazonas, Brazil
[2] UTFPR, CODEC DES, Recife, PE, Brazil
[3] UTFPR, CPGEI, Curitiba, Parana, Brazil
[4] Univ Fed Santa Catarina, GPqCom EEL, Florianopolis, SC, Brazil
来源：
2013 36TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP) | 2013年
关键词：
Convolutional codes; decoding complexity; trellis module; Viterbi algorithm;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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. The computational cost of implementation of each operation is determined in terms of machine cycles taken by its execution. A relation between the complexity measure defined in this work and the one defined by McEliece and Lin is investigated. The system architecture adopted is the TMS320C55xx fixed-point digital signal processor family from Texas Instruments.
引用
收藏
页码：144 / 148
页数：5
相关论文
共 50 条
  • [21] State-complexity reduction for convolutional codes using trellis-modlule integration
    Tajima, Masato
    Okino, Koji
    Miyagoshi, Takashi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (10) : 2466 - 2474
  • [22] Reduced complexity decoding of convolutional codes based on the M-algorithm and the minimal trellis
    Souza, Richard Demo
    Pimentel, Cecilio
    Muniz, Daiana Nascimento
    ANNALS OF TELECOMMUNICATIONS, 2012, 67 (11-12) : 537 - 545
  • [23] Trellis complexity of short linear codes
    Bocharova, Irina E.
    Johannesson, Rolf
    Kudryashov, Boris D.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (01) : 361 - 368
  • [24] Alternative Syndrome-Trellis Codes with Reduced Trellis Complexity
    Liu, Wei-Wei
    Liu, Guang-Jie
    Dai, Yue-Wei
    Journal of Information Hiding and Multimedia Signal Processing, 2014, 5 (04): : 769 - 777
  • [25] Sectionalization of the Minimal Trellis Module for Convolutional Codes
    Benchimol, Isaac
    Pimentel, Cecilio
    Souza, Richard Demo
    2012 35TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP), 2012, : 227 - 232
  • [26] A Low-Complexity Dual Trellis Decoding Algorithm for High-Rate Convolutional Codes
    Vinh Hoang Son Le
    Nour, Charbel Abdel
    Douillard, Catherine
    Boutillon, Emmanuel
    2020 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2020,
  • [27] Analysis of the trellis complexity of interleavers and turbo codes
    Garello, R
    Montorsi, G
    Benedetto, S
    Cancellieri, G
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 65 - 65
  • [28] Trellis decoding complexity of linear block codes
    Kiely, AB
    Dolinar, SJ
    McEliece, RJ
    Ekroot, LL
    Lin, W
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) : 1687 - 1697
  • [29] Designing lexicographic codes with a given trellis complexity
    Trachtenberg, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (01) : 89 - 100
  • [30] Lower bounds on trellis complexity of block codes
    Lafourcade, A
    Vardy, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (06) : 1938 - 1954
12345