Improved Stopping Set Elimination by Parity-Check Matrix Extension of LDPC Codes

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 284
  • Download : 0
Stopping sets associated with a parity-check matrix of low-density parity-check codes limit the performance of iterative decoding over the binary erasure channel. In this letter, we propose a parity-check matrix extension scheme that eliminates stopping sets of small sizes. The results show that our proposed scheme provides significant performance improvement compared to previously known parity-check matrix extension schemes.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2011-05
Language
English
Article Type
Article
Citation

IEEE COMMUNICATIONS LETTERS, v.15, no.5, pp.557 - 559

ISSN
1089-7798
DOI
10.1109/LCOMM.2011.032811.102095
URI
http://hdl.handle.net/10203/96285
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 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0