On the Performance of Sequential and Viterbi Decoders for High-Rate Punctured Convolutional Codes

K. Muhammad, Khaled Letaief

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This paper presents new computationally efficient and accurate techniques for estimating the performance of specific high-rate punctured convolutional codes and uses these techniques to evaluate the performance of sequential and Viterbi decoders for the best known codes. In particular, it demonstrates that the disparity between sequential and Viterbi decoding increases dramatically for long memory codes with high rates and for such codes, the union bound cannot be used as a criterion for selecting good codes for sequential decoders. In contrast, it shows that the proposed methods can be used as efficient tools for performance evaluation and/or identification of good high-rate punctured convolutional codes for use with sequential decoders.

Original languageEnglish
Pages (from-to)2687-2695
Number of pages9
JournalIEEE Transactions on Communications
Volume43
Issue number11
DOIs
Publication statusPublished - 1 Nov 1995
Externally publishedYes

Fingerprint

Convolutional codes
Decoding
Data storage equipment

Keywords

  • importance sampling
  • Punctured convolutional codes
  • sequential and Viterbi decoding

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

On the Performance of Sequential and Viterbi Decoders for High-Rate Punctured Convolutional Codes. / Muhammad, K.; Letaief, Khaled.

In: IEEE Transactions on Communications, Vol. 43, No. 11, 01.11.1995, p. 2687-2695.

Research output: Contribution to journalArticle

@article{7ed12dad04cf42f781619cdaaccc0d9e,
title = "On the Performance of Sequential and Viterbi Decoders for High-Rate Punctured Convolutional Codes",
abstract = "This paper presents new computationally efficient and accurate techniques for estimating the performance of specific high-rate punctured convolutional codes and uses these techniques to evaluate the performance of sequential and Viterbi decoders for the best known codes. In particular, it demonstrates that the disparity between sequential and Viterbi decoding increases dramatically for long memory codes with high rates and for such codes, the union bound cannot be used as a criterion for selecting good codes for sequential decoders. In contrast, it shows that the proposed methods can be used as efficient tools for performance evaluation and/or identification of good high-rate punctured convolutional codes for use with sequential decoders.",
keywords = "importance sampling, Punctured convolutional codes, sequential and Viterbi decoding",
author = "K. Muhammad and Khaled Letaief",
year = "1995",
month = "11",
day = "1",
doi = "10.1109/26.481219",
language = "English",
volume = "43",
pages = "2687--2695",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - On the Performance of Sequential and Viterbi Decoders for High-Rate Punctured Convolutional Codes

AU - Muhammad, K.

AU - Letaief, Khaled

PY - 1995/11/1

Y1 - 1995/11/1

N2 - This paper presents new computationally efficient and accurate techniques for estimating the performance of specific high-rate punctured convolutional codes and uses these techniques to evaluate the performance of sequential and Viterbi decoders for the best known codes. In particular, it demonstrates that the disparity between sequential and Viterbi decoding increases dramatically for long memory codes with high rates and for such codes, the union bound cannot be used as a criterion for selecting good codes for sequential decoders. In contrast, it shows that the proposed methods can be used as efficient tools for performance evaluation and/or identification of good high-rate punctured convolutional codes for use with sequential decoders.

AB - This paper presents new computationally efficient and accurate techniques for estimating the performance of specific high-rate punctured convolutional codes and uses these techniques to evaluate the performance of sequential and Viterbi decoders for the best known codes. In particular, it demonstrates that the disparity between sequential and Viterbi decoding increases dramatically for long memory codes with high rates and for such codes, the union bound cannot be used as a criterion for selecting good codes for sequential decoders. In contrast, it shows that the proposed methods can be used as efficient tools for performance evaluation and/or identification of good high-rate punctured convolutional codes for use with sequential decoders.

KW - importance sampling

KW - Punctured convolutional codes

KW - sequential and Viterbi decoding

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

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

U2 - 10.1109/26.481219

DO - 10.1109/26.481219

M3 - Article

VL - 43

SP - 2687

EP - 2695

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 11

ER -