TY - JOUR
T1 - A Generator-Matrix-Based Approach for Adaptively Generating Cut-Inducing Redundant Parity Checks
AU - Falsafain, Hossein
AU - Mousavi, Seyed Rasoul
PY - 2016/4
Y1 - 2016/4
N2 - A generator matrix (GM)-based approach for adaptively deriving cut-inducing redundant parity checks (RPCs) during the adaptive linear programming decoding algorithm is presented. More precisely speaking, if the decoder gets stuck in a non-integral pseudocodeword, then the resulting RPCs are likely to provide violated forbidden-set inequalities that can separate this non-integral optimal solution from the feasible region. The described approach can be viewed as a GM-based counterpart of the approach proposed by Zhang and Siegel in 2012. For binary linear codes of low rate, while providing the same error-correcting performance, our approach requires much less computational time compared to its analogue.
AB - A generator matrix (GM)-based approach for adaptively deriving cut-inducing redundant parity checks (RPCs) during the adaptive linear programming decoding algorithm is presented. More precisely speaking, if the decoder gets stuck in a non-integral pseudocodeword, then the resulting RPCs are likely to provide violated forbidden-set inequalities that can separate this non-integral optimal solution from the feasible region. The described approach can be viewed as a GM-based counterpart of the approach proposed by Zhang and Siegel in 2012. For binary linear codes of low rate, while providing the same error-correcting performance, our approach requires much less computational time compared to its analogue.
UR - https://www.scopus.com/pages/publications/84964378087
U2 - 10.1109/LCOMM.2016.2530706
DO - 10.1109/LCOMM.2016.2530706
M3 - Article
SN - 1558-2558
VL - 20
SP - 640
EP - 643
JO - IEEE Communications Letters
JF - IEEE Communications Letters
IS - 4
ER -