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 条

[1] Convolutional Codes Under a Minimal Trellis Complexity Measure
Uchoa-Filho, Bartolomeu F.
Souza, Richard Demo
Pimentel, Cecilio
Jar, Marcel
IEEE TRANSACTIONS ON COMMUNICATIONS, 2009, 57 (01) : 1 - 5
[2] On trellis modules for convolutional codes
Souza, RD
Uchôa, BF
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 427 - 427
[3] The trellis complexity of convolutional codes
McEliece, RJ
Lin, W
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) : 1855 - 1864
[4] Further Results on Convolutional Codes Based on a Minimal Trellis Complexity Measure
Ucha-Filho, Bartolomeu F.
Souza, Richard Demo
Pimentel, Cecilio
Jar, Marcel
PROCEEDINGS OF THE IEEE INTERNATIONAL TELECOMMUNICATIONS SYMPOSIUM, VOLS 1 AND 2, 2006, : 123 - +
[5] 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, : 1 - 10
[6] A new computational decoding complexity measure of convolutional codes
Isaac B Benchimol
Cecilio Pimentel
Richard Demo Souza
Bartolomeu F Uchôa-Filho
EURASIP Journal on Advances in Signal Processing, 2014
[7] On the behavior of the distance spectrum of convolutional codes under a minimal trellis complexity measure
Uchoa-Filho, Bartolomeu F.
Demo Souza, Richard
Pimentel, Cecilio
2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 283 - +
[8] A comparison of trellis modules for binary convolutional codes
Hole, KJ
IEEE TRANSACTIONS ON COMMUNICATIONS, 1998, 46 (10) : 1245 - 1249
[9] Minimal trellis modules and equivalent convolutional codes
Tang, Hung-Hua
Lin, Mao-Chao
Uchoa Filho, Bartolorneu F.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (08) : 3738 - 3746
[10] On trellis complexity constrained convolutional codes of maximum length
Rosnes, E
Ytrehus, O
2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 277 - 277

← 1 2 3 4 5 →