Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electronic and Information Engineering | en_US |
| dc.contributor.advisor | Lau, C. M. Francis (EIE) | en_US |
| dc.creator | Zhang, Pengwei | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/11454 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | en_US |
| dc.rights | All rights reserved | en_US |
| dc.title | Protograph-based low-density parity-check hadamard codes | en_US |
| dcterms.abstract | This thesis proposes and analyzes a new class of ultimate-ShannonÂlimit approaching codes, namely protograph-based low-density parity-check (PLDPC) Hadamard codes. This class of code has a low code rate and can achieve excellent error performance even at a very low bit-energy-to-noise-power-spectral-density ratio (i.e., Eb/N0 < 0 dB). Application scenarios include multiple access wireless systems with a huge number of non-orthogonal users and deep space communications. Firstly, we describe the protograph structure and protomatrix of a protograph-based low-density parity-check Hadamard block code (PLDPCH-BC). To optimize the structure of the PLDPCH-BC, we propose a low-complexity Protograph Extrinsic Information Transfer (PEXIT) method based on Monte Carlo simulations. Given multiple a priori information and channel information, the proposed method can obtain multiple extrinsic mutual information (MI) from the symbol-by-symbol maximum a posteriori probability (symbol-MAP) Hadamard decoder. Moreover, this method is applicable to low/high and/or even/odd order of Hadamard codes, and can compute the theoretical thresholds of PLDPCH-BCs with degree-1 or/and punctured variable nodes. Optimized designs for PLDPCH-BCs with Hadamard codes of different orders are derived. Simulations are performed on the constructed codes and the simulated error rates are compared with those of traditional LDPC-Hadamard codes. In addition, PLDPCH-BCs are punctured and their simulation results are compared with unpunctured PLDPCH-BCs. Secondly, we propose an efficient and effective layered decoding algorithm for PLDPCH-BCs, and compare its convergence speed with that of the standard decoding algorithm. We further implement the proposed layered decoding algorithm onto hardware, namely an FPGA board, and evaluate its error performance under different throughputs. The error degradation due to fixed-point computation is also evaluated. Thirdly, we make use of the optimized PLDPCH-BC designs to construct spatially-coupled PLDPC-Hadamard convolutional codes (SC-PLDPCH-CCs), the error performance of which is also close to the ultimate Shannon limit. We introduce the encoding of SC-PLDPCH-CCs using their convolutional parity-check matrices. We propose a pipelined decoding strategy with a layered decoding algorithm so as to perform efficient and effective decoding for the SC-PLDPCH-CCs. We simulate the error performance of SC-PLDPCH-CCs with different rates and different number of processors contained in pipeline decoding. The error performance of the SC-PLDPCH-CCs is compared with that of PLDPCH-BCs. | en_US |
| dcterms.extent | xix, 142 pages : color illustrations | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2021 | en_US |
| dcterms.educationalLevel | Ph.D. | en_US |
| dcterms.educationalLevel | All Doctorate | en_US |
| dcterms.LCSH | Error-correcting codes (Information theory) | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
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/11454