Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/95543
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electronic and Information Engineering | en_US |
dc.creator | Zhang, PW | en_US |
dc.creator | Lau, FCM | en_US |
dc.creator | Sham, CW | en_US |
dc.date.accessioned | 2022-09-21T01:40:51Z | - |
dc.date.available | 2022-09-21T01:40:51Z | - |
dc.identifier.issn | 0090-6778 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/95543 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | en_US |
dc.rights | The following publication P. -W. Zhang, F. C. M. Lau and C. -W. Sham, "Protograph-Based LDPC Hadamard Codes," in IEEE Transactions on Communications, vol. 69, no. 8, pp. 4998-5013, Aug. 2021 is available at https://doi.org/10.1109/TCOMM.2021.3077939 | en_US |
dc.subject | PEXIT algorithm | en_US |
dc.subject | PLDPC-Hadamard code | en_US |
dc.subject | Protograph LDPC code | en_US |
dc.subject | Ultimate Shannon limit | en_US |
dc.title | Protograph-based LDPC hadamard codes | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 4998 | en_US |
dc.identifier.epage | 5013 | en_US |
dc.identifier.volume | 69 | en_US |
dc.identifier.issue | 8 | en_US |
dc.identifier.doi | 10.1109/TCOMM.2021.3077939 | en_US |
dcterms.abstract | In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes - a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes in a generalized protograph-based LDPC code, followed by lifting the generalized protograph. We name the codes formed protograph-based LDPC Hadamard (PLDPC-Hadamard) codes. We also propose a modified Protograph Extrinsic Information Transfer (PEXIT) algorithm for analyzing and optimizing PLDPC-Hadamard code designs. The proposed algorithm further allows the analysis of PLDPC-Hadamard codes with degree- 1 and/or punctured nodes. We find codes with decoding thresholds ranging from -1.53 dB to -1.42 dB. At a BER of 10-5, the gaps of our codes to the ultimate-Shannon-limit range from 0.40 dB (for rate = 0.0494) to 0.16 dB (for rate = 0.003). Moreover, the error performance of our codes is comparable to that of the traditional LDPC-Hadamard codes. Finally, the BER performances of our codes after puncturing are simulated and compared. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IEEE transactions on communications, Aug. 2021, v. 69, no. 8, p. 4998-5013 | en_US |
dcterms.isPartOf | IEEE transactions on communications | en_US |
dcterms.issued | 2021-08 | - |
dc.identifier.scopus | 2-s2.0-85105865553 | - |
dc.identifier.eissn | 1558-0857 | en_US |
dc.description.validate | 202209 bcfc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | EIE-0845 | - |
dc.description.fundingSource | Self-funded | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 54856452 | - |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhang_Protograph-Based_Ldpc_Hadamard.pdf | Pre-Published version | 1.15 MB | Adobe PDF | View/Open |
Page views
60
Last Week
0
0
Last month
Citations as of Oct 13, 2024
Downloads
56
Citations as of Oct 13, 2024
SCOPUSTM
Citations
8
Citations as of Oct 17, 2024
WEB OF SCIENCETM
Citations
6
Citations as of Oct 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.