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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 22; číslo 5; s. 874 - 877
Hlavní autoři: Oh, Jieun, Ha, Jeongseok
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.05.2018
Témata:
Complexity theory
Decoding
Iterative decoding
Low-density parity-check codes
Manganese
Performance evaluation
Reliability
weighted bit-flipping algorithms
ISSN:1089-7798
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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