LDPC Codes--Structural Analysis and Decoding Techniques
Saved in:
| Title: | LDPC Codes--Structural Analysis and Decoding Techniques |
|---|---|
| Language: | English |
| Authors: | Zhang, Xiaojie |
| Source: | ProQuest LLC. 2012Ph.D. Dissertation, University of California, San Diego. |
| Availability: | ProQuest LLC. 789 East Eisenhower Parkway, P.O. Box 1346, Ann Arbor, MI 48106. Tel: 800-521-0600; Web site: http://www.proquest.com/en-US/products/dissertations/individuals.shtml |
| Peer Reviewed: | N |
| Page Count: | 160 |
| Publication Date: | 2012 |
| Document Type: | Dissertations/Theses - Doctoral Dissertations |
| Descriptors: | Coding, Information Technology, Structural Analysis (Science), Mathematics |
| ISBN: | 978-1-267-83450-8 |
| Abstract: | Low-density parity-check (LDPC) codes have been the focus of much research over the past decade thanks to their near Shannon limit performance and to their efficient message-passing (MP) decoding algorithms. However, the error floor phenomenon observed in MP decoding, which manifests itself as an abrupt change in the slope of the error-rate curve, has hindered the adoption of LDPC codes and MP decoders in some applications requiring very low error rates. As an alternative to MP decoding, linear programming (LP) decoding is an approximation to maximum-likelihood decoding by relaxing the optimal decoding problem into a linear optimization problem. It has been noticed that, when the symbols error probability in channel output is low, LP decoding has superior error correction performance. However, due to the inefficiency of general-purpose LP solvers which are not optimized for solving LP problems, LP decoding is computationally more complex than MP decoding, especially for codes of large block size. In this dissertation, we first design an efficient exhaustive search algorithm to find all small error-prone substructures, some of which are commonly blamed for certain decoding failures of MP decoding. Then, we investigate the cause of error floors in LDPC codes from the perspective of the MP decoder implementation, with special attention to limitations that decrease the numerical accuracy of messages passed during decoding, and propose a quantization method for fixed-point implementation of MP decoding which significantly improves the error-floor performance by overcoming the limitations of standard quantization rules. For LP decoding, we improve the error-correcting capability of LP decoding by using an effective algorithm to generate additional redundant parity-check constraints which eliminate certain undesired solutions to LP decoding problem. We further propose an efficient message-passing algorithm to solve the LP decoding problem. This algorithm is based on the alternating direction method of multipliers (ADMM), a classic technique in convex optimization theory, and our key contribution is a novel, efficient projection algorithm that can improve the decoding speed of the ADMM-based LP decoder. The last part of this dissertation is a separate piece of work on optimizing video transmission over distributed cognitive radio network. [The dissertation citations contained here are published with the permission of ProQuest LLC. Further reproduction is prohibited without permission. Copies of dissertations may be obtained by Telephone (800) 1-800-521-0600. Web page: http://www.proquest.com/en-US/products/dissertations/individuals.shtml.] |
| Abstractor: | As Provided |
| Entry Date: | 2015 |
| Access URL: | https://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:3548182 |
| Accession Number: | ED551592 |
| Database: | ERIC |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: eric DbLabel: ERIC An: ED551592 AccessLevel: 3 PubType: Dissertation/ Thesis PubTypeId: dissertation PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: LDPC Codes--Structural Analysis and Decoding Techniques – Name: Language Label: Language Group: Lang Data: English – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Zhang%2C+Xiaojie%22">Zhang, Xiaojie</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="SO" term="%22ProQuest+LLC%22"><i>ProQuest LLC</i></searchLink>. 2012Ph.D. Dissertation, University of California, San Diego. – Name: Avail Label: Availability Group: Avail Data: ProQuest LLC. 789 East Eisenhower Parkway, P.O. Box 1346, Ann Arbor, MI 48106. Tel: 800-521-0600; Web site: http://www.proquest.com/en-US/products/dissertations/individuals.shtml – Name: PeerReviewed Label: Peer Reviewed Group: SrcInfo Data: N – Name: Pages Label: Page Count Group: Src Data: 160 – Name: DatePubCY Label: Publication Date Group: Date Data: 2012 – Name: TypeDocument Label: Document Type Group: TypDoc Data: Dissertations/Theses - Doctoral Dissertations – Name: Subject Label: Descriptors Group: Su Data: <searchLink fieldCode="DE" term="%22Coding%22">Coding</searchLink><br /><searchLink fieldCode="DE" term="%22Information+Technology%22">Information Technology</searchLink><br /><searchLink fieldCode="DE" term="%22Structural+Analysis+%28Science%29%22">Structural Analysis (Science)</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink> – Name: ISBN Label: ISBN Group: ISBN Data: 978-1-267-83450-8 – Name: Abstract Label: Abstract Group: Ab Data: Low-density parity-check (LDPC) codes have been the focus of much research over the past decade thanks to their near Shannon limit performance and to their efficient message-passing (MP) decoding algorithms. However, the error floor phenomenon observed in MP decoding, which manifests itself as an abrupt change in the slope of the error-rate curve, has hindered the adoption of LDPC codes and MP decoders in some applications requiring very low error rates. As an alternative to MP decoding, linear programming (LP) decoding is an approximation to maximum-likelihood decoding by relaxing the optimal decoding problem into a linear optimization problem. It has been noticed that, when the symbols error probability in channel output is low, LP decoding has superior error correction performance. However, due to the inefficiency of general-purpose LP solvers which are not optimized for solving LP problems, LP decoding is computationally more complex than MP decoding, especially for codes of large block size. In this dissertation, we first design an efficient exhaustive search algorithm to find all small error-prone substructures, some of which are commonly blamed for certain decoding failures of MP decoding. Then, we investigate the cause of error floors in LDPC codes from the perspective of the MP decoder implementation, with special attention to limitations that decrease the numerical accuracy of messages passed during decoding, and propose a quantization method for fixed-point implementation of MP decoding which significantly improves the error-floor performance by overcoming the limitations of standard quantization rules. For LP decoding, we improve the error-correcting capability of LP decoding by using an effective algorithm to generate additional redundant parity-check constraints which eliminate certain undesired solutions to LP decoding problem. We further propose an efficient message-passing algorithm to solve the LP decoding problem. This algorithm is based on the alternating direction method of multipliers (ADMM), a classic technique in convex optimization theory, and our key contribution is a novel, efficient projection algorithm that can improve the decoding speed of the ADMM-based LP decoder. The last part of this dissertation is a separate piece of work on optimizing video transmission over distributed cognitive radio network. [The dissertation citations contained here are published with the permission of ProQuest LLC. Further reproduction is prohibited without permission. Copies of dissertations may be obtained by Telephone (800) 1-800-521-0600. Web page: http://www.proquest.com/en-US/products/dissertations/individuals.shtml.] – Name: AbstractInfo Label: Abstractor Group: Ab Data: As Provided – Name: DateEntry Label: Entry Date Group: Date Data: 2015 – Name: URL Label: Access URL Group: URL Data: <link linkTarget="URL" linkTerm="https://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:3548182" linkWindow="_blank">http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:3548182</link> – Name: AN Label: Accession Number Group: ID Data: ED551592 |
| PLink | https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=eric&AN=ED551592 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English PhysicalDescription: Pagination: PageCount: 160 Subjects: – SubjectFull: Coding Type: general – SubjectFull: Information Technology Type: general – SubjectFull: Structural Analysis (Science) Type: general – SubjectFull: Mathematics Type: general Titles: – TitleFull: LDPC Codes--Structural Analysis and Decoding Techniques Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Zhang, Xiaojie IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2012 Identifiers: – Type: isbn-print Value: 978-1-267-83450-8 Titles: – TitleFull: ProQuest LLC Type: main |
| ResultId | 1 |