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

Cited 8 time in webofscience Cited 0 time in scopus
  • Hit : 511
  • Download : 0
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 hits for the bit-decision results and syndrome values at hit 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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2018-05
Language
English
Article Type
Article
Keywords

PARITY-CHECK CODES; SETS

Citation

IEEE COMMUNICATIONS LETTERS, v.22, no.5874, pp.874 - 877

ISSN
1089-7798
DOI
10.1109/LCOMM.2018.2809718
URI
http://hdl.handle.net/10203/242424
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0