Layered Decoding for Protograph-Based Low-Density Parity-Check Hadamard Codes

Peng W. Zhang, Francis C.M. Lau, Chiu W. Sham

Research output: Journal article publicationJournal articleAcademic researchpeer-review

4 Citations (Scopus)


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\times 10^{-5} , 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.

Original languageEnglish
Article number9349523
Pages (from-to)1776-1780
Number of pages5
JournalIEEE Communications Letters
Issue number6
Publication statusPublished - Jun 2021


  • Convergence rate
  • layered decoding
  • protograph-based LDPC-Hadamard codes
  • ultimate Shannon limit

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Layered Decoding for Protograph-Based Low-Density Parity-Check Hadamard Codes'. Together they form a unique fingerprint.

Cite this