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

Author

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

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Nat. Chi Nan Univ., Taiwan

Volume

44

Issue

3

fYear

1998

fDate

5/1/1998 12:00:00 AM

Firstpage

1233

Lastpage

1246

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 (1993). 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

Keywords

block codes; coding errors; error statistics; linear codes; maximum likelihood decoding; optimisation; probability; search problems; binary BCH code; binary extended quadratic residue code; communication systems; computational effort; error probability; generalized Dijkstra´s algorithm; linear block codes; maximum-likelihood soft-decision decoding algorithm; optimal decoding algorithm; performance analysis; priority-first search; suboptimal decoding algorithm; upper bound; Block codes; Communication channels; Concurrent computing; Matrix converters; Maximum likelihood decoding; Parity check codes; Performance analysis; Redundancy; Upper bound; Viterbi algorithm;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.669296

Filename

669296