Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electronic and Information Engineering | en_US |
| dc.contributor.advisor | Lau, Francis (EIE) | en_US |
| dc.creator | Li, Yidong | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/12050 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | en_US |
| dc.rights | All rights reserved | en_US |
| dc.title | Modified noisy gradient descent bit-flipping decoding algorithms for LDPC codes | en_US |
| dcterms.abstract | A few modified Noisy Gradient Descent Bit Flipping (NGDBF) algorithms have been proposed for decoding Low-Density Parity-Check (LDPC) codes on the additive white Gaussian noise (AWGN) channel, which are categorized as NGDBF+. A new idea is introduced to generate the perturbation signals by using a transformation method to process the received messages. It means that random number generators (RNG) are no longer needed for NGDBF+ to generate perturbation signal, which can reduce the complexity of the whole system to some degree. Another innovation of this algorithm is that it combines the advantages of both GDBF and NGDBF algorithms. The GDBF algorithm is used in the first few iterations, and the NGDBF algorithm is used in the remaining iterations. By using the GDBF algorithm to speed up convergence, the error correction performance and convergence speed of the NGDBF+ algorithm can be improved. Another innovation of this algorithm is that the flip state of the bits in the current iteration will be recorded to adjust the threshold in the next iteration. This threshold will make it difficult for most flipped bits to be flipped in the next iteration. Hence, it can reduce oscillation to some degree and it can reduce the threshold sensitivity of this algorithm. Moreover, a new idea is proposed to re-use the flip state to eliminate the delay caused by the global operation. Therefore, the throughput can be further increased. In general, compared with NGDBF algorithm, NGDBF+ algorithm can achieve 0.15dB error correction performance improvement and nearly 30% increase in convergence speed. Furthermore, this is a hardware-friendly design. The hardware architecture details are presented for implementing the NGDBF+ algorithm. Complexity analysis is also included. | en_US |
| dcterms.extent | xxvii, 68 pages : color illustrations | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2022 | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.LCSH | Coding theory | 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 | |
|---|---|---|---|---|
| 6514.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 5.35 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/12050