Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electronic and Information Engineering | en_US |
| dc.creator | Jia, Ru | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/6623 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Study of low-density parity-check decoding algorithms | en_US |
| dcterms.abstract | Low-density parity-check (LDPC) code is a class of error-correcting codes whose capacity approaches Shannon's limit. Due to the advantages of LDPC codes, such as lower decoding complexity and lower the error floor, its applications on reliable communications attract academic field and IT industrial field's high attention. Nowadays, it becomes one of the most attractive topics in channel coding. In this thesis, on the basis of existing theory of LDPC codes, the LDPC decoding ideas are analyzed and summarized systemically. The detailed derivation of the sum-product algorithm about information updated principles based on both additive white Gaussian noise (AWGN) channels and log-likelihood ratio is shown. With the algorithm mentioned above, an estimated and approximate algorithm (min-sum decoding algorithm) is given. Moreover, modifications to the min-sum decoding algorithm are proposed. Modified min-sum decoding algorithm can improve the performance while the complexity of the algorithm is increasing. To reduce the computation complexity, quantization and clipping methods on sum-product and min-sum decoding algorithms with a little performance loss are introduced. In many cases, 4-bit quantized decoding algorithms are close to ideal performance in a wide range of signal-to-noise ratio. In this thesis, a lot of simulations on sum-product decoding algorithm, min-sum decoding algorithm, quantized sum-product decoding algorithm, quantized min-sum decoding algorithm and modified min-sum decoding algorithm are performed. Through analyzing the simulation results, the basis of existing theory of LDPC codes is validated. The performance of quantized decoding algorithm with different number of levels is compared. Comparing the modified min-sum decoding algorithm with the original algorithm (no modification and quantization), the advantage and characteristic of the modified min-sum decoding algorithm are illustrated. Future work can include improving the encoding and decoding algorithms of LDPC codes, and construction of LDPC codes. | en_US |
| dcterms.extent | x, 94 leaves : ill. ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2012 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Error-correcting codes (Information theory) | en_US |
| dcterms.LCSH | Coding theory -- Mathematics. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b25226290.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 3.29 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/6623