Maximum Weight Basis Decoding of Convolutional Codes

Files in this item

Files Size Format View
Das2000Jun4MaximumWei.PDF 264.4Kb application/pdf Thumbnail
Das2000Jun4MaximumWei.PS 184.7Kb application/postscript View/Open

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: Presentation
Keywords: convolutional code; Viterbi algorithm; decoding
Citation: S. Das, E. Erkip, J. R. Cavallaro and B. Aazhang, "Maximum Weight Basis Decoding of Convolutional Codes," Wireless Communication and Networking Conference, 2000.
Abstract: The effectiveness 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. In this paper we propose a suboptimal decoding method based on the calculation of the maximum weight basis of the convolutional code. We extend the algorithm to incorporate the ideas of list decoding method. 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: 2000-06-20

This item appears in the following Collection(s)

  • ECE Publications [1048 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students