Maximum weight basis decoding of convolutional codes

Suman Das, Elza Erkip, Joseph R. Cavallaro, Behnaam Aazhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we describe a new suboptimal decoding technique for linear codes based on the calculation of maximum weight basis of the code. The idea is based on estimating the maximum number locations in a codeword which have least probability of estimation error without violating the codeword structure. In this paper we discuss the details of the algorithm for a convolutional code. The error correcting capability of the convolutional code increases with the constraint length of the code. Unfortunately the decoding complexity of Viterbi algorithm grows exponentially with the constraint length. We also augment the maximal weight basis algorithm by incorporating the ideas of list decoding technique. The complexity of the algorithm grows only quadratically with the constraint length and the performance of the algorithm is comparable to the optimal Viterbi decoding method.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
PublisherIEEE
Pages835-841
Number of pages7
Volume2
StatePublished - 2000

Fingerprint

Convolutional codes
Decoding
Viterbi algorithm
Error analysis
code

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Das, S., Erkip, E., Cavallaro, J. R., & Aazhang, B. (2000). Maximum weight basis decoding of convolutional codes. In Conference Record / IEEE Global Telecommunications Conference (Vol. 2, pp. 835-841). IEEE.

Maximum weight basis decoding of convolutional codes. / Das, Suman; Erkip, Elza; Cavallaro, Joseph R.; Aazhang, Behnaam.

Conference Record / IEEE Global Telecommunications Conference. Vol. 2 IEEE, 2000. p. 835-841.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Das, S, Erkip, E, Cavallaro, JR & Aazhang, B 2000, Maximum weight basis decoding of convolutional codes. in Conference Record / IEEE Global Telecommunications Conference. vol. 2, IEEE, pp. 835-841.
Das S, Erkip E, Cavallaro JR, Aazhang B. Maximum weight basis decoding of convolutional codes. In Conference Record / IEEE Global Telecommunications Conference. Vol. 2. IEEE. 2000. p. 835-841
Das, Suman ; Erkip, Elza ; Cavallaro, Joseph R. ; Aazhang, Behnaam. / Maximum weight basis decoding of convolutional codes. Conference Record / IEEE Global Telecommunications Conference. Vol. 2 IEEE, 2000. pp. 835-841
@inproceedings{44124d842581485fb190c608df3f13ea,
title = "Maximum weight basis decoding of convolutional codes",
abstract = "In this paper we describe a new suboptimal decoding technique for linear codes based on the calculation of maximum weight basis of the code. The idea is based on estimating the maximum number locations in a codeword which have least probability of estimation error without violating the codeword structure. In this paper we discuss the details of the algorithm for a convolutional code. The error correcting capability of the convolutional code increases with the constraint length of the code. Unfortunately the decoding complexity of Viterbi algorithm grows exponentially with the constraint length. We also augment the maximal weight basis algorithm by incorporating the ideas of list decoding technique. The complexity of the algorithm grows only quadratically with the constraint length and the performance of the algorithm is comparable to the optimal Viterbi decoding method.",
author = "Suman Das and Elza Erkip and Cavallaro, {Joseph R.} and Behnaam Aazhang",
year = "2000",
language = "English (US)",
volume = "2",
pages = "835--841",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Maximum weight basis decoding of convolutional codes

AU - Das, Suman

AU - Erkip, Elza

AU - Cavallaro, Joseph R.

AU - Aazhang, Behnaam

PY - 2000

Y1 - 2000

N2 - In this paper we describe a new suboptimal decoding technique for linear codes based on the calculation of maximum weight basis of the code. The idea is based on estimating the maximum number locations in a codeword which have least probability of estimation error without violating the codeword structure. In this paper we discuss the details of the algorithm for a convolutional code. The error correcting capability of the convolutional code increases with the constraint length of the code. Unfortunately the decoding complexity of Viterbi algorithm grows exponentially with the constraint length. We also augment the maximal weight basis algorithm by incorporating the ideas of list decoding technique. The complexity of the algorithm grows only quadratically with the constraint length and the performance of the algorithm is comparable to the optimal Viterbi decoding method.

AB - In this paper we describe a new suboptimal decoding technique for linear codes based on the calculation of maximum weight basis of the code. The idea is based on estimating the maximum number locations in a codeword which have least probability of estimation error without violating the codeword structure. In this paper we discuss the details of the algorithm for a convolutional code. The error correcting capability of the convolutional code increases with the constraint length of the code. Unfortunately the decoding complexity of Viterbi algorithm grows exponentially with the constraint length. We also augment the maximal weight basis algorithm by incorporating the ideas of list decoding technique. The complexity of the algorithm grows only quadratically with the constraint length and the performance of the algorithm is comparable to the optimal Viterbi decoding method.

UR - http://www.scopus.com/inward/record.url?scp=0034475580&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034475580&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0034475580

VL - 2

SP - 835

EP - 841

BT - Conference Record / IEEE Global Telecommunications Conference

PB - IEEE

ER -