Title

Decoding Linear Block Codes Using a Priority-First Search: Performance Analysis and Suboptimal Version

Author(s)/Creator(s)

Yunghsiang S. Han, Syracuse University
Carlos R.P. Hartmann, Syracuse UniversityFollow
Kishan Mehrotra, Syracuse UniversityFollow

Document Type

Report

Date

3-1994

Keywords

block codes, decoding, Dijkstra's algorithm, maximum-likelihood, priority-first search, soft-decision, trellis, performance analysis, suboptimal

Language

English

Disciplines

Computer Sciences

Description/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 report 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 computation performance of the algorithm. A suboptimal decoding algorithm is also proposed. The performance of this suboptimal decoding algorithm is within 0.25 dB and 0.5 dB of the performance of an optimal decoding algorithm for the (104, 52) binary extended quadratic residue code and the (128, 64) binary extended BCH code, respectively.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-94-4

Authors later published: Han, Y. -S; Hartmann, C. R P; Mehrotra, K.G., "Decoding linear block codes using a priority-first search: performance analysis and suboptimal version," Information Theory, IEEE Transactions on , vol.44, no.3, pp.1233,1246, May 1998 doi: 10.1109/18.669296

Recommended Citation

Han, Yunghsiang S.; Hartmann, Carlos R.P.; and Mehrotra, Kishan, "Decoding Linear Block Codes Using a Priority-First Search: Performance Analysis and Suboptimal Version" (1994). Electrical Engineering and Computer Science - Technical Reports. 155.
https://surface.syr.edu/eecs_techreports/155

Source

local