.png){kind=icon}
.png){kind=icon}
Return
Decoding Binary Linear Block Codes Using Local Search
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2013.041113.120057.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 epsilon of the channel is known, the solution space of the decoding problem can be decreased to a sphere whose radius is related to epsilon. 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 left perpendiculard-1/2right perpendicular, 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.
Keywords:
Integer programming decoding
maximum likelihood hard decision decoding
iterative decoding
multi-flip local search decoding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W