.png){kind=icon}
Return
Decoding Binary Linear Codes Using Penalty Dual Decomposition Method
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2019.2911277.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Iterative decoding
binary linear codes
penalty dual decomposition
decomposition method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
ShareSaveRGB-Marking to Identify Patterns of Selection and Neutral Evolution in Human Osteosarcoma Models.png)
Cancers
OAAI
CancersIF0
OAAIShareSave
ShareSaveShareSaveAnalysis and Design of High-Efficiency Bidirectional GaN-Based CLLC Resonant ConverterEnergiesOAAI
EnergiesIF0
OAAIShareSave
View more