.png){kind=icon}
返回
Decoding Binary Linear Codes Using Penalty Dual Decomposition Method
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2019.2911277.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this letter, we utilize the penalty dual decomposition (PDD) framework and develop a novel PDD decoding algorithm for binary linear codes. Instead of relaxing the discrete constraints to continuous ones, we take an alternative by transforming them into equivalent equality constraints. This idea leads to a double-loop parallel algorithm: In the outer loop, we update the dual variables and certain penalty parameters, while in the inner loop, we divide the primal variables into several blocks and employ the block successive upper-bound minimization method to iteratively optimize each block variable in closed form. Every limit point generated by the proposed algorithm is guaranteed to be a stationary point of the maximum likelihood decoding problem. Simulation results demonstrate that the proposed algorithm shows great error rate performance at both low and high signal-to-noise ratios.
Keyword:
Iterative decoding
binary linear codes
penalty dual decomposition
decomposition method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
RGB-Marking to Identify Patterns of Selection and Neutral Evolution in Human Osteosarcoma Models.png)
Cancers
OAAI
CancersIF0
OAAI分享收藏
分享收藏Analysis and Design of High-Efficiency Bidirectional GaN-Based CLLC Resonant ConverterEnergiesOAAI
EnergiesIF0
OAAI分享收藏
查看更多内容