View in EDS

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

Saved in:
Bibliographic Details
Title: Decoding Linear Block Codes Using a Priority-First Search: Performance Analysis and Suboptimal Version
Authors: Yunghsiang S. Han, Carlos R. P. Hartmann, Kishan G. Mehrotra
Contributors: The Pennsylvania State University CiteSeerX Archives
Source: http://web.ntpu.edu.tw/~yshan/it982_performance.pdf.
Publication Year: 1988
Collection: CiteSeerX
Subject Terms: Index Terms—Block codes, decoding, Dijkstra’s algorithm
Description: —An efficient maximum-likelihood soft-decision decoding al-gorithm 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 103 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.
Document Type: text
File Description: application/pdf
Language: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.598.1411; http://web.ntpu.edu.tw/~yshan/it982_performance.pdf
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.598.1411
http://web.ntpu.edu.tw/~yshan/it982_performance.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number: edsbas.4FC6EF52
Database: BASE
Description
Abstract:—An efficient maximum-likelihood soft-decision decoding al-gorithm 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 103 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.