Please use this identifier to cite or link to this item:
PIRA download icon_1.1View/Download Full Text
Title: Layered decoding for protograph-based low-density parity-check Hadamard codes
Authors: Zhang, PW 
Lau, FCM 
Sham, CW
Issue Date: Jun-2021
Source: IEEE communications letters, June 2021, v. 25, no. 6, p. 1776 - 1780
Abstract: In this letter, we propose a layered decoding algorithm for protograph-based low-density parity-check Hadamard codes (PLDPC-HCs), which have been shown to be ultimate-Shannon-limit approaching. Compared with the standard decoding algorithm, the layered decoding algorithm improves the convergence rate by about two times. At a bit error rate of 2.0×10⁻⁵ , the layered decoder using 20 decoding iterations shows a very small degradation of 0.03 dB compared with the standard decoder using 40 decoding iterations. Moreover, the layered decoder using 21 decoding iterations shows the same error performance as the standard decoder using 41 decoding iterations.
Keywords: Convergence rate
Layered decoding
Protograph-based LDPC-Hadamard codes
Ultimate Shannon limit
Publisher: Institute of Electrical and Electronics Engineers
Journal: IEEE communications letters 
ISSN: 1089-7798
DOI: 10.1109/LCOMM.2021.3057717
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.
The following publication P. W. Zhang, F. C. M. Lau and C. -W. Sham, "Layered Decoding for Protograph-Based Low-Density Parity-Check Hadamard Codes," in IEEE Communications Letters, vol. 25, no. 6, pp. 1776-1780, June 2021 is available at
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
a0569-n01_268_FINAL VERSION.pdfPre-Published version999.78 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

Last Week
Last month
Citations as of May 28, 2023


Citations as of May 28, 2023


Citations as of May 25, 2023


Citations as of May 25, 2023

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.