Show simple item record

dc.contributor.advisorVasic, Baneen
dc.contributor.advisorMarcellin, Michael W.en
dc.contributor.authorNguyen, Dung Viet
dc.date.accessioned2016-02-04T19:04:16Zen
dc.date.available2016-02-04T19:04:16Zen
dc.date.issued2011-10en
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/595635en
dc.descriptionITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevadaen_US
dc.description.abstractWe present a methodology to search for harmful subgraphs in the Tanner graph of a regular column-weightthree low-density parity-check (LDPC) code. These harmful subgraphs, which are more commonly known under the name "trapping sets," cause a degradation in the error correcting performance of LDPC codes in the high signal-to-noise ratio (SNR) region. Our method of searching for trapping sets utilizes the Trapping Set Ontology, a database in which trapping sets are arranged according to their topological relationships. Based on the topological relationships, larger trapping sets are searched for by expanding smaller ones. This reduces the complexity and the run-times of the search algorithms and allows large trapping sets to be searched for efficiently. Besides, if the LDPC code is quasi-cyclic then our search algorithms can be futher simplified. Our method of searching for trapping sets is useful in the performance analysis of LDPC codes and in the construction of good LDPC codes. In this paper, we demonstrate the use of the method in the construction of good LDPC codes.
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © held by the author; distribution rights International Foundation for Telemeteringen_US
dc.titleMethods of Searching for Trapping Sets of Quasi-Cyclic LDPC Codes and their Applications in Code Constructionen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentUniversity of Arizonaen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.description.collectioninformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.en
refterms.dateFOA2018-07-01T01:04:13Z
html.description.abstractWe present a methodology to search for harmful subgraphs in the Tanner graph of a regular column-weightthree low-density parity-check (LDPC) code. These harmful subgraphs, which are more commonly known under the name "trapping sets," cause a degradation in the error correcting performance of LDPC codes in the high signal-to-noise ratio (SNR) region. Our method of searching for trapping sets utilizes the Trapping Set Ontology, a database in which trapping sets are arranged according to their topological relationships. Based on the topological relationships, larger trapping sets are searched for by expanding smaller ones. This reduces the complexity and the run-times of the search algorithms and allows large trapping sets to be searched for efficiently. Besides, if the LDPC code is quasi-cyclic then our search algorithms can be futher simplified. Our method of searching for trapping sets is useful in the performance analysis of LDPC codes and in the construction of good LDPC codes. In this paper, we demonstrate the use of the method in the construction of good LDPC codes.


Files in this item

Thumbnail
Name:
ITC_2011_11-03-01.pdf
Size:
550.6Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record