TY - GEN
T1 - Message-passing decoding beyond the girth with local-optimality guarantees
AU - Halabi, Nissim
AU - Even, Guy
PY - 2012
Y1 - 2012
N2 - We present a new message-passing iterative decoding algorithm, called normalized weighted min-sum (NWMS). NWMS-decoding is a BP-type algorithm that applies to any irregular Tanner code with single parity-check local codes (e. g. , LDPC codes and HDPC codes). The decoding guarantee of NWMS applies whenever there exists a locally optimal codeword. We prove that if a locally-optimal codeword with respect to height parameter h exists, then NWMS-decoding finds it in h iterations. This decoding guarantee holds for every finite value of h and is not limited by the girth. Because local optimality of a codeword implies that it is the unique ML-codeword, the decoding guarantee also has an ML-certificate.
AB - We present a new message-passing iterative decoding algorithm, called normalized weighted min-sum (NWMS). NWMS-decoding is a BP-type algorithm that applies to any irregular Tanner code with single parity-check local codes (e. g. , LDPC codes and HDPC codes). The decoding guarantee of NWMS applies whenever there exists a locally optimal codeword. We prove that if a locally-optimal codeword with respect to height parameter h exists, then NWMS-decoding finds it in h iterations. This decoding guarantee holds for every finite value of h and is not limited by the girth. Because local optimality of a codeword implies that it is the unique ML-codeword, the decoding guarantee also has an ML-certificate.
UR - http://www.scopus.com/inward/record.url?scp=84871956551&partnerID=8YFLogxK
U2 - 10.1109/EEEI.2012.6376924
DO - 10.1109/EEEI.2012.6376924
M3 - פרסום בספר כנס
AN - SCOPUS:84871956551
SN - 9781467346801
T3 - 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
BT - 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
Y2 - 14 November 2012 through 17 November 2012
ER -