A Two-Bit Weighted Bit-Flipping Decoding Algorithm for LDPC Codes

This letter proposes a novel two-bit weighted bit-flipping algorithm (TB-WBFA) for low-density parity-check (LDPC) codes on the binary symmetric channel. The proposed TB-WBFA produces reliability bits for the bit-decision results and syndrome values at bit and check nodes, respectively. The reliabil...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE communications letters Vol. 22; no. 5; pp. 874 - 877
Main Authors:	Oh, Jieun, Ha, Jeongseok
Format:	Journal Article
Language:	English
Published:	IEEE 01.05.2018
Subjects:	Complexity theory Decoding Iterative decoding Low-density parity-check codes Manganese Performance evaluation Reliability weighted bit-flipping algorithms
ISSN:	1089-7798
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This letter proposes a novel two-bit weighted bit-flipping algorithm (TB-WBFA) for low-density parity-check (LDPC) codes on the binary symmetric channel. The proposed TB-WBFA produces reliability bits for the bit-decision results and syndrome values at bit and check nodes, respectively. The reliability bits are exchanged between bit and check nodes as the decoding proceeds. The message update in check nodes is carefully devised with simple bitwise operations, which are especially suitable for high-speed operations. It will be demonstrated that the proposed TB-WBFA achieves a significant performance improvement over existing bit-flipping decoding algorithms by conducting performance comparisons for LDPC codes under various setups, i.e., different rates, lengths, and structures.
ISSN:	1089-7798
DOI:	10.1109/LCOMM.2018.2809718