A stopping criterion for low-density parity-check codes

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 378
  • Download : 851
We propose a new stopping criterion for decoding LDPC codes which Consists of a measure of decoder behaviors and a decision rule to predict decoding failure. We will show that the proposed measure, the number of satisfied check nodes, does not need (or minimizes) additional complexity, and the decision rule is efficient and more importantly channel independent, which was not possible in the previous work.
Publisher
IEICE
Issue Date
2008-04
Language
English
Article Type
Article
Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E91B, pp.1145 - 1148

ISSN
0916-8516
DOI
10.1093/ietcom/e91-b.4.1145
URI
http://hdl.handle.net/10203/13312
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
000255647900018.pdf(696.27 kB)Download
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0