Methods of Searching for Trapping Sets of Quasi-Cyclic LDPC Codes and their Applications in Code Construction
| dc.contributor.advisor | Vasic, Bane | en |
| dc.contributor.advisor | Marcellin, Michael W. | en |
| dc.contributor.author | Nguyen, Dung Viet | |
| dc.date.accessioned | 2016-02-04T19:04:16Z | en |
| dc.date.available | 2016-02-04T19:04:16Z | en |
| dc.date.issued | 2011-10 | en |
| dc.identifier.issn | 0884-5123 | en |
| dc.identifier.issn | 0074-9079 | en |
| dc.identifier.uri | http://hdl.handle.net/10150/595635 | en |
| dc.description | ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada | en_US |
| dc.description.abstract | We 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.sponsorship | International Foundation for Telemetering | en |
| dc.language.iso | en_US | en |
| dc.publisher | International Foundation for Telemetering | en |
| dc.relation.url | http://www.telemetry.org/ | en |
| dc.rights | Copyright © held by the author; distribution rights International Foundation for Telemetering | en_US |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.title | Methods of Searching for Trapping Sets of Quasi-Cyclic LDPC Codes and their Applications in Code Construction | en_US |
| dc.type | text | en |
| dc.type | Proceedings | en |
| dc.contributor.department | University of Arizona | en |
| dc.identifier.journal | International Telemetering Conference Proceedings | en |
| dc.description.collectioninformation | Proceedings 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.dateFOA | 2018-07-01T01:04:13Z | |
| html.description.abstract | We 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. |
