Paper Info
Title
Soft-decision decoding of binary linear block codes based on an iterative search algorithm
Abstract
This article presents a suboptimum soft-decision decoding scheme for binary linear block codes based on an iterative search algorithm. The scheme uses an algebraic decoder to iteratively generate a sequence of candidate codewords one at a time using a set of test error patterns that are constructed based on the reliability information of the received symbols. When a candidate codeword is generated, it is tested based on an optimality condition. If it satisfies the optimality condition, then it is the most likely (ML) codeword and the decoding stops. If it fails the optimality test, a search for the ML codeword is conducted in a region which contains the ML codeword. The search region is determined by the current candidate codeword and the reliability of the received symbols. The search is conducted through a purged trellis diagram for the given code using the Viterbi algorithm. If the search fails to find the ML codeword, a new candidate is generated using a new test error pattern, and the optimality test and search are renewed. The process of testing and search continues until either the ML codeword is found or all the test error patterns are exhausted and the decoding process is terminated. Numerical results show that the proposed decoding scheme achieves either practically optimal performance or a performance only a fraction of a decibel away from the optimal maximum-likelihood decoding with a significant reduction in decoding complexity compared with the Viterbi decoding based on the full trellis diagram of the codes
Year
DOI
Venue
1997
10.1109/18.568717
IEEE Transactions on Information Theory
Keywords
Field
DocType
decoding stop,current candidate codeword,soft-decision decoding,decoding complexity,ml codeword,iterative search algorithm,optimality test,binary linear block code,decoding process,test error pattern,optimality condition,candidate codeword,optimization,algorithms,block codes,testing,search algorithm,golay code,viterbi algorithm,bch code,bit error rate,hamming distance,iteration,upper bound,decoding,computational complexity,binary codes,symbols,decoders
Discrete mathematics,Combinatorics,Sequential decoding,Parity-check matrix,Computer science,Block code,Algorithm,Viterbi decoder,Decoding methods,Standard array,List decoding,Viterbi algorithm
Journal
Volume
Issue
ISSN
43
3
0018-9448
ISBN
Citations 
PageRank 
0-7803-2453-6
20
2.52
References 
Authors
20
3
Name
Order
Citations
PageRank
H. T. Moorthy1293.60
Shu Lin2575133.22
T. Kasami3836357.33