Electronics Letters

Probabilistic hard-decision table look-up decoding for binary block codes

M.A. El-Agamy, E. Munday

Published Oct 25, 1984• 1 citation

Abstract

A probabilistic hard-decision decoding algorithm based on the weight distribution of binary block codes and the random error distribution in the channel is briefly described. It reduces the number of look-up iterations performed in the conventional exhaustive search table look-up minimum distance decoder.

DOI: 10.1049/el:19840627

Related papers

An Iterative Soft-Decision Decoding Algorithm

Shu Wen Lin, Takuya Koumoto, Toyoo Takata +1 more

This paper presents a new minimum-weight trellis-based soft-decision iterative decoding algorithm for binary linear block codes. Simulation results for the RM(64,22), EBCH(64,24), RM(64,42) and EBCH(64,45) codes show that the proposed decoding algorithm achieves practically (or near) optimal error performance with significant reduction in decoding computational complexity. The average number of search iterations is also small even for low signal-to-noise ratio.

Jul 10, 19967 citations

Decoding Binary Linear Block Codes Using Local Search

Morteza Esmaeili, A. Alampour, Thomas Aaron Gulliver

This paper presents a novel iterative hard decision decoding algorithm for binary linear block codes over a binary symmetric channel (BSC). The problem is formulated as a 0-1 integer programming problem which is known to be NP-hard. When the crossover probability c of the channel is known, the solution space of the decoding problem can be decreased to a sphere whose radius is related to c. Using the penalty function method, the problem is reformulated on this reduced solution space. Then an iterative multi-flip local search algorithm is designed to find the global solution of this decoding problem. For a code with minimum distance d, when the radius of the sphere is not greater than d-1/2, this algorithm has the maximum likelihood (ML) certificate property, i.e., if the decoder outputs a codeword, it is guaranteed to be the ML codeword. Compared to the probabilistic suboptimal iterative belief propagation (BP) decoder, this approach has lower complexity and better performance. Numerical results show that in terms of speed and performance the proposed decoding method outperforms BP decoding in the error floor region.

IEEE Transactions on CommunicationsJun 1, 20136 citations

A method for convergence analysis of iterative probabilistic decoding

Miodrag J. Mihaljević, Jovan Dj. Golić

A novel analytical approach to performance evaluation of soft-decoding algorithms for binary linear block codes based on probabilistic iterative error correction is presented. A convergence condition establishing the critical noise rate below which the expected bit-error probability tends to zero is theoretically derived. It explains the capability of iterative probabilistic decoding of binary linear block codes with sparse parity-check matrices to correct, with probability close to one, error patterns with the number of errors (far) beyond half the code minimum distance. Systematic experiments conducted on truncated simplex codes seem to agree well with the convergence condition. The method may also be interesting for the theoretical analysis of the so-called turbo codes.

IEEE Transactions on Information TheoryJan 1, 200015 citations

On Chase-Like Bound-Distance Decoding Algorithms

Ling bin Yan, Li rong Yu, Wei jia Lu +2 more

For the decoding of a binary linear block code of Hamming distance of d over AWGN channels, a soft-decision decoder is said to be bounded-distance (BD) decoding if its squared error-correction radius is equal to d .A Chase-like algorithm outputs the best (most likely) codeword in a list of candidates generated by a conventional algebraic binary decoder whose input vectors are determined by the reliability order of the hard-decisions.Let ) (d 

International Conference on Advanced Computer Science and Electronics Information (ICACSEI)Jan 1, 20130 citations

A Probabilistic Algorithm for Computing the Weight Distribution of LDPC Codes

Masanori Hirotomo, Masami Mohri, Masakatu Morii

Low-density parity-check (LDPC) codes are linear block codes defined by sparse parity-check matrices. The codes exhibit excellent performance under iterative decoding, and the weight distribution is used to analyze lower error probability of their decoding performance. In this paper, we propose a probabilistic method for computing the weight distribution of LDPC codes. The proposed method efficiently finds low-weight codewords in a given LDPC code by using Stern's algorithm, and stochastically computes the low part of the weight distribution from the frequency of the found codewords. It is based on a relation between the number of codewords with a given weight and the rate of generating the codewords in Stern's algorithm. In the numerical results for LDPC codes of length 504, 1008 and 4896, we could compute the weight distribution by the proposed method with greater accuracy than by conventional methods.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20096 citations

Half-Chase Algorithm of Non-soft Decision Decoding Based on Majority

Chun-Fong Kuo, Hsin-Kun Lai, Erl‐Huei Lu

A non-soft decision decoding algorithm for binary linear block codes transmitted over AWGN channel is presented. Unlike soft decision decoding algorithms, the proposed algorithm does not computing weighted Hamming distances. Based on the majority of code word candidates from the hard decision decoding output, the proposed algorithm improves error-correcting performance by 1 dB of coding gain compared to that of hard decision decoding algorithms. Also, a schematic block diagram for finding the codeword of majority is developed. Furthermore, a comparison of hardware complexity is made between the computation of weighted Hamming distances and the finding of majority code word.

International Conference on Advanced Communication TechnologyFeb 1, 20070 citations