Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electronic and Information Engineering | en_US |
| dc.creator | Li, Miaolei | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/6371 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Construction of QC-LDPC codes with large girth | en_US |
| dcterms.abstract | In this report, we use Fibonacci sequences to fill the exponent matrices of the parity-check matrices of quasi-cyclic low-density parity-check (QC-LDPC) codes. Using the Fibonacci sequences, the corresponding LDPC code has no cycle 4.Using the Fibonacci sequences, we can easily construct codes with girth 8. Simulation results show that over an Additive White Gaussian Noise (AWGN) channel, the error performance of our code is much better than that of array codes. The LDPC code using Fibonacci sequence can achieve much lower bit error rate (BER) than that of array codes. Then we improve the method of using Fibonacci sequence to the method of using a combination of Fibonacci sequence and A.P. (Arithmetic Progression). Simulation results show that error performance of code using Fibonacci sequence and A.P. is almost the same as that of using Fibonacci sequence only. We find a new type of code that can perform as well as the code using Fibonacci sequence only. Then we improve the method of using Fibonacci sequence only to the method of using a combination of Fibonacci sequence and G.P. (Geometric Progression). For (3,6) QC-LDPC code, the error performance of code using Fibonacci sequence only is much worse than that of code using a combination of Fibonacci sequence and G.P. Next we propose the definition of 1st order difference Fibonacci sequence. Then we improve the Fibonacci sequence method to the method of using a combination of Fibonacci sequence and 1st order difference Fibonacci sequence. Simulation results show that the error performance of using Fibonacci sequence and 1st order difference Fibonacci sequence is much better than that of using Fibonacci sequence only. Then we propose a method that can avoid cycle 6 using the Fibonacci sequence. Last but not least, we contrast the influence on cycles of 5 kinds of construction functions. We draw the conclusion that the construction function f(i,j) = a ʲ⁻¹ b ⁱ⁻¹ the best form. So if we want to construct LDPC codes with large girth, we can use the form f(i,j) = a ʲ⁻¹ b ⁱ⁻¹ directly. There is no need for us to try other kinds of construction functions. | en_US |
| dcterms.extent | xi, 85 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 | Coding theory -- Mathematics. | en_US |
| dcterms.LCSH | Error-correcting codes (Information theory) | 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 | |
|---|---|---|---|---|
| b2471060x.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 2.07 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/6371