Decoding linear block codes using a priority-first search: Performance analysis and suboptimal version

Yunghsiang S. Han, Carlos R.P. Hartmann, Kishan G. Mehrotra

Research output: Contribution to journalArticle

17 Scopus citations

Abstract

An efficient maximum-likelihood soft-decision decoding algorithm for linear block codes using a generalized Dijkstra's algorithm was proposed by Han, Hartmann, and Chen. In this correspondence we prove that this algorithm is efficient for most practical communication systems where the probability of error is less than 10-3 by finding an upper bound of the computational effort of the algorithm. A suboptimal decoding algorithm is also proposed. The performance of this suboptimal decoding algorithm is within 0.25 dB of the performance of an optimal decoding algorithm for the (104, 52) binary extended quadratic residue code, and within 0.5 dB of the optimal performance for the (128, 64) binary BCH code, respectively.

Original languageEnglish (US)
Pages (from-to)1233-1246
Number of pages14
JournalIEEE Transactions on Information Theory
Volume44
Issue number3
DOIs
StatePublished - 1998

Keywords

  • Block codes
  • Decoding
  • Dijkstra's algorithm
  • Maximum-likelihood
  • Soft-decision
  • Suboptimal

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Decoding linear block codes using a priority-first search: Performance analysis and suboptimal version'. Together they form a unique fingerprint.

  • Cite this