Breaking the Trapping Sets in LDPC Codes: Check Node Removal and Collaborative Decoding

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 461
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKang, Soonyoungko
dc.contributor.authorMoon, Jaekyunko
dc.contributor.authorHa, Jeongseokko
dc.contributor.authorShin, Jinwooko
dc.date.accessioned2016-06-07T09:08:13Z-
dc.date.available2016-06-07T09:08:13Z-
dc.date.created2015-10-29-
dc.date.created2015-10-29-
dc.date.issued2016-01-
dc.identifier.citationIEEE TRANSACTIONS ON COMMUNICATIONS, v.64, no.1, pp.15 - 26-
dc.identifier.issn0090-6778-
dc.identifier.urihttp://hdl.handle.net/10203/207766-
dc.description.abstractTrapping sets strongly degrade performance of low-density parity check (LDPC) codes in the low-error-rate region. This creates significant difficulties for the deployment of LDPC codes to low-error-rate applications such as storage and wireless systems with no or limited retransmission options. We propose a novel technique for breaking trapping sets based on collaborative decoding that utilizes two different decoding modes. While the main decoding mode executes message passing based on the original parity check matrix of the corresponding LDPC code, the sub-decoding mode operates on a modified parity check matrix formed by removing a portion of check nodes in the factor graph representation of the given code. The modified parity check matrix is designed to promote a passing of correct information into erroneous variable nodes in the trapping set. Theoretical properties of the proposed trapping-set-breaking technique have been established based on the notion of the improved separation for the trapped variable nodes. Simulation results show that the proposed collaborative LDPC decoding scheme switching between the two decoding modes back and forth effectively breaks dominant trapping sets of various known types of regular and irregular LDPC codes.-
dc.languageEnglish-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.subjectERROR-CORRECTION-
dc.subjectDECODERS-
dc.titleBreaking the Trapping Sets in LDPC Codes: Check Node Removal and Collaborative Decoding-
dc.typeArticle-
dc.identifier.wosid000368353700003-
dc.identifier.scopusid2-s2.0-84958212998-
dc.type.rimsART-
dc.citation.volume64-
dc.citation.issue1-
dc.citation.beginningpage15-
dc.citation.endingpage26-
dc.citation.publicationnameIEEE TRANSACTIONS ON COMMUNICATIONS-
dc.identifier.doi10.1109/TCOMM.2015.2498161-
dc.contributor.localauthorMoon, Jaekyun-
dc.contributor.localauthorHa, Jeongseok-
dc.contributor.localauthorShin, Jinwoo-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorLow-density parity-check codes-
dc.subject.keywordAuthormessage passing-
dc.subject.keywordAuthorerror floor-
dc.subject.keywordAuthortrapping set-
dc.subject.keywordAuthorcollaborative decoding-
dc.subject.keywordPlusERROR-CORRECTION-
dc.subject.keywordPlusDECODERS-
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 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0