Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electronic and Information Engineering | en_US |
| dc.creator | Zhou, Weijie | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/6438 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | LDPC code design for cooperative communications | en_US |
| dcterms.abstract | The low-density parity-check code (LDPC) is one potential error correction code that can achieve the Shannon capacity with belief propagation (BP) decoding. In order to design a good LDPC code with low bit error rate (BER), two numerical methods called density evolution (DE) and Gaussian approximation (GA) are developed. These two methods are powerful in analyzing the performance of an LDPC code ensemble. Since they are effective in finding the threshold of an LDPC code ensemble with certain degree distribution, DE and GA are widely used in the optimization of the LDPC code. Besides, recent research of the relay channel system includes employing distributed LDPC codes on the relay channels. So we first review the relay system and focus on one coding scheme - the LDPC coded relay scheme. Compared to optimization of the LDPC code for a single link, the bilayer LDPC code optimization is more complex since the code should have good performance on two links at diferent signal-to-noise ratios (SNRs). In this thesis, we frst propose the stability condition (SC) method as a fast method to find the threshold of an LDPC ensemble. Then we propose to use a simple but efective optimization algorithm, called diferential evolution, combined with GA/DE/SC to optimize the LDPC code. As for the bilayer LDPC code, we derive the Gaussian approximation based on the bilayer density evolution. We also use the differential evolution to optimize the bilayer LDPC code. The results show that the optimized LDPC code and bilayer LDPC code have good performance with small gaps between their thresholds and the theoretical Shannon limit. Besides, it is proved that our method is effective and efficient. | en_US |
| dcterms.extent | 60 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 | |
|---|---|---|---|---|
| b2475769x.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 1.11 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/6438