.png){kind=icon}
返回
Decoding Binary Linear Block Codes Using Local Search
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2013.041113.120057.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Integer programming decoding
maximum likelihood hard decision decoding
iterative decoding
multi-flip local search decoding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
RGB-Marking to Identify Patterns of Selection and Neutral Evolution in Human Osteosarcoma Models.png)
Cancers
OAAI
CancersIF0
OAAI分享收藏
查看更多内容