Low-density parity -check codes and iterative decoding algorithms for input -constrained channels and channels with memory
The quest to construct good error-correcting codes that are amendable to low complexity decoding has been vigorously pursued since 1948 when Shannon introduced the channel coding theory. A class of codes, known as Low-Density Parity Check (LDPC) Codes, have received a lot of attention of late, due t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertation |
| Language: | English |
| Published: |
ProQuest Dissertations & Theses
01.01.2003
|
| Subjects: | |
| ISBN: | 9780496274192, 0496274198 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The quest to construct good error-correcting codes that are amendable to low complexity decoding has been vigorously pursued since 1948 when Shannon introduced the channel coding theory. A class of codes, known as Low-Density Parity Check (LDPC) Codes, have received a lot of attention of late, due to their near capacity-achieving performance while employing low-complexity iterative decoding algorithms. We have applied Gallager's method and typical set decoding method to evaluate lower bounds on the maximum achievable rate and error exponents of LDPC codes when used over the binary erasure channel and the binary-input AWGN channel. The results indicate that LDPC codes can achieve performance nearly as good as the best codes when used on these channels. In this dissertation, we also investigate some applications of LDPC codes and their iterative decoding algorithms. First, we study the performance of LDPC codes when used over the block interference channel with a receiver that performs joint channel state estimation and information bit decoding. The theoretical performance of the algorithm is evaluated using the density evolution technique which reveals the dependency of the system performance on the code degree sequence. In the second part of the dissertation, the concatenation of an outer LDPC code with an inner runlength-limited (RLL) code is investigated. A message-passing algorithm is employed to exchange soft information between the two decoders. The algorithm efficiently exploits the redundancy inherent in the RLL code resulting in additional coding gain over the unconcatenated LDPC codes. The density evolution technique is extended to analyze the performance of such a system. |
|---|---|
| AbstractList | The quest to construct good error-correcting codes that are amendable to low complexity decoding has been vigorously pursued since 1948 when Shannon introduced the channel coding theory. A class of codes, known as Low-Density Parity Check (LDPC) Codes, have received a lot of attention of late, due to their near capacity-achieving performance while employing low-complexity iterative decoding algorithms. We have applied Gallager's method and typical set decoding method to evaluate lower bounds on the maximum achievable rate and error exponents of LDPC codes when used over the binary erasure channel and the binary-input AWGN channel. The results indicate that LDPC codes can achieve performance nearly as good as the best codes when used on these channels. In this dissertation, we also investigate some applications of LDPC codes and their iterative decoding algorithms. First, we study the performance of LDPC codes when used over the block interference channel with a receiver that performs joint channel state estimation and information bit decoding. The theoretical performance of the algorithm is evaluated using the density evolution technique which reveals the dependency of the system performance on the code degree sequence. In the second part of the dissertation, the concatenation of an outer LDPC code with an inner runlength-limited (RLL) code is investigated. A message-passing algorithm is employed to exchange soft information between the two decoders. The algorithm efficiently exploits the redundancy inherent in the RLL code resulting in additional coding gain over the unconcatenated LDPC codes. The density evolution technique is extended to analyze the performance of such a system. |
| Author | Vijacksungsithi, Wongkot |
| Author_xml | – sequence: 1 givenname: Wongkot surname: Vijacksungsithi fullname: Vijacksungsithi, Wongkot |
| BookMark | eNo9jU1LxDAYhAMqqGv_Q_BeyFfbt0dZ_IKFPeh9SZu327htUpPUZf31VlY8DTPMPHNLLp13eEGyugKm6lJUitfimmQx2oYxWUshS3FDvjf-mBt00aYTnXT4lbztsT3Q1huMVDtDbcKgk_1CanBJrdtTPez9Uu7HSDsfqHXTnJahdzEFbR0a2vbaORzOhH9zXDZ0xNGH0x256vQQMfvTFXl7enxfv-Sb7fPr-mGTHyqu8oIzLJQwAAw5NAYENLxuOwFMlNgK2ahCA0DdAStLBN4ZjUUDSkPJ0cgVuT9Tp-A_Z4xp9-Hn4JbDnWSFFFCwSv4ASuRctw |
| ContentType | Dissertation |
| Copyright | Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| Copyright_xml | – notice: Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| DBID | 053 0BH 0NL CBPLH EU9 G20 M8- OK5 PHGZT PKEHL PQEST PQQKQ PQUKI |
| DatabaseName | Dissertations & Theses Europe Full Text: Science & Technology ProQuest Dissertations and Theses Professional Dissertations & Theses @ University of Michigan ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations & Theses A&I ProQuest Dissertations & Theses Global ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection Dissertations & Theses @ Big Ten Academic Alliance ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition |
| DatabaseTitle | ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations and Theses Professional ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest Dissertations & Theses Global Dissertations & Theses Europe Full Text: Science & Technology Dissertations & Theses @ University of Michigan ProQuest One Academic UKI Edition Dissertations & Theses @ CIC Institutions ProQuest One Academic ProQuest Dissertations & Theses A&I ProQuest One Academic (New) |
| DatabaseTitleList | ProQuest One Academic Middle East (New) |
| Database_xml | – sequence: 1 dbid: G20 name: ProQuest Dissertations & Theses Global url: https://www.proquest.com/pqdtglobal1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 765321251 |
| Genre | Dissertation/Thesis |
| GroupedDBID | 053 0BD 0BH 0NL ALMA_UNASSIGNED_HOLDINGS CBPLH EU9 G20 M8- OK5 PHGZT PKEHL PQEST PQQKQ PQUKI |
| ID | FETCH-LOGICAL-k714-510e542d880e18bd828b19cf28026ec23b45a8889f8066e81fdae5b84a861ed3 |
| IEDL.DBID | G20 |
| ISBN | 9780496274192 0496274198 |
| IngestDate | Sun Jun 29 15:56:44 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-k714-510e542d880e18bd828b19cf28026ec23b45a8889f8066e81fdae5b84a861ed3 |
| Notes | SourceType-Dissertations & Theses-1 ObjectType-Dissertation/Thesis-1 content type line 12 |
| PQID | 305328507 |
| PQPubID | 18750 |
| ParticipantIDs | proquest_journals_305328507 |
| PublicationCentury | 2000 |
| PublicationDate | 20030101 |
| PublicationDateYYYYMMDD | 2003-01-01 |
| PublicationDate_xml | – month: 01 year: 2003 text: 20030101 day: 01 |
| PublicationDecade | 2000 |
| PublicationYear | 2003 |
| Publisher | ProQuest Dissertations & Theses |
| Publisher_xml | – name: ProQuest Dissertations & Theses |
| SSID | ssib003932362 ssib000933042 |
| Score | 1.3759447 |
| Snippet | The quest to construct good error-correcting codes that are amendable to low complexity decoding has been vigorously pursued since 1948 when Shannon introduced... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Electrical engineering |
| Title | Low-density parity -check codes and iterative decoding algorithms for input -constrained channels and channels with memory |
| URI | https://www.proquest.com/docview/305328507 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NSwMxEA1aPYgHFRW1Kjl4DZJsdps9eVCLh1IEPfRW8qmldlu7W6X-emfSbS0IXjwtYdmwJJk3b5KZPEKugkiy1AhAv1R6JrMgmdFWMcWTzAcvgnXxdv1Oq9tVvV7-WOfmlHVa5RITI1C7scU98usEJQwUsJebyTtD0Sg8XK0VNDbJFhbXxlrfdfazCNZ_li9wFcDrWJe-0JzJ1fIOnrotfkFy9DPtvX_-4T7ZvVs7Xz8gG744JF-d8SdzmKhezSmKDsKDwVzZIcWC9pLqwtHF7coAfdRBQIoOjeq3F-i_eh2VFJgtHRSTWQUfIqFEXQnvKFYNF-BcYw-rBm7t0hFm8M6PyFP7_vn2gdWSC2zY4pKBgfpUCgdG7bkyDsIxw3MbhIJQzVuRGJlqiJnzoICqeMWD0z41SmqVce-SY9IoxoU_IVTnuTDg_63RRrYcN9IHMH7lACMCkMBT0lwOYr-2mrK_GsGzP982yU5MqYsbIeekUU1n_oJs249qUE4v4xr4BsmivAg |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT8JAEN0gmmg8qFGj4sce9Lgx3W7L9mA8iAQCEhM5cJLsdneVIAVpkeBf8k8621IkMfHGwVOzabrJdqYzb6Yz8xC6NNT1PUnB-nlME-YbRqQIOeGO62ujqQlVOl2_WW61eKcTPBbQV94LY8sqc5uYGmo1DG2O_Nq1FAYc0Mvt6J1Y0ij7czVn0Mi0oqFnU4jY4pt6BcR7RWn1vn1XI3NSAdIvO4yACmqPUQVqqx0uFQQc0glCQzkEIzqkrmSegKgwMBycseaOUUJ7kjPBfUcrF3ZdQ-vMzrmzncXLWCtLDfx8LICMwDukXfAZw03A84k_8zX95QBSr1bd-VfvYxdtV5ZqB_ZQQUf76LM5nBJli_CTGbaEinAhoIdhH9tm_RiLSOFscjSYdawg2LbOGou3FzhN8jqIMaB23ItGkwQetGDZcmZohW1HdATAId1hsbBpazyw1cmzA_S0gpMeomI0jPQRwiIIqARsE0ohWVk5kmkDho0rsH8GAO4xKuUi684tQtxdyOvkz7sXaLPWfmh2m_VWo4S20tLBNOFziorJeKLP0Eb4kfTi8XmqfRg9r1a43yXMFeo |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adissertation&rft.genre=dissertation&rft.title=Low-density+parity+-check+codes+and+iterative+decoding+algorithms+for+input+-constrained+channels+and+channels+with+memory&rft.DBID=053%3B0BH%3B0NL%3BCBPLH%3BEU9%3BG20%3BM8-%3BOK5%3BPHGZT%3BPKEHL%3BPQEST%3BPQQKQ%3BPQUKI&rft.PQPubID=18750&rft.au=Vijacksungsithi%2C+Wongkot&rft.date=2003-01-01&rft.pub=ProQuest+Dissertations+%26+Theses&rft.isbn=9780496274192&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=765321251 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780496274192/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780496274192/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780496274192/sc.gif&client=summon&freeimage=true |