deposit_your_work

Maximum Weight Basis Decoding of Convolutional Codes

Files in this item

Files Size Format View
00globecom_suman.pdf 99.69Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Maximum Weight Basis Decoding of Convolutional Codes
Author: Das, Suman; Erkip, Elza; Cavallaro, Joseph R.; Aazhang, Behnaam
Type: Conference Paper
Publisher: IEEE
Citation: S. Das, E. Erkip, J. R. Cavallaro and B. Aazhang,"Maximum Weight Basis Decoding of Convolutional Codes," in IEEE Global Telecommunications Conference (Globecom), 2000, pp. 835-841.
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.
Date Published: 2002-11-01

This item appears in the following Collection(s)

  • ECE Publications [1047 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • CMC Publications [275 items]
    Publications by Rice Faculty and graduate students in multimedia communications