Further results on decoding linear block codes using a generalized dijkstra's algorithm

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

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

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. We propose an even more efficient new version of this algorithm. An upper bound on the number of nodes searched by this new decoding algorithm is derived and a suboptimal decoding algorithm is also proposed.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE Computer Society
StatePublished - 1994
Externally publishedYes
EventProceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw
Duration: Jun 27 1994Jul 1 1994

Other

OtherProceedings of the 1994 IEEE International Symposium on Information Theory
CityTrodheim, Norw
Period6/27/947/1/94

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Further results on decoding linear block codes using a generalized dijkstra's algorithm'. Together they form a unique fingerprint.

  • Cite this

    Han, Y. S., Hartmann, C. R. P., & Mehrotra, K. G. (1994). Further results on decoding linear block codes using a generalized dijkstra's algorithm. In IEEE International Symposium on Information Theory - Proceedings IEEE Computer Society.