Reordered static layered schedule for 5G low‐density parity‐check codes

The error performance of the 5G low‐density parity‐check codes is significantly impacted by the update order of layers. At present, the row degree (RD) and the number of punctured bits (PBs) are widely used to decide the update order of layers. Here, the authors propose a metric to assess the soft m...

Full description

Saved in:
Bibliographic Details
Published in:Electronics letters 2024-04, Vol.60 (7), p.n/a
Main Authors: Zhou, Yangcan, Wang, Zhongfeng
Format: Article
Language:English
Subjects:
circuits and systems
error correction codes
iterative decoding
parity check codes
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The error performance of the 5G low‐density parity‐check codes is significantly impacted by the update order of layers. At present, the row degree (RD) and the number of punctured bits (PBs) are widely used to decide the update order of layers. Here, the authors propose a metric to assess the soft message recovery speed of coded bits and then suggest updating layers with the lowest RD first rather than those with the least PBs first. Besides, a new criterion is introduced to further determine the update order of layers with the same number of PBs and the same RD. The resulting reordered layered schedule yields better error performance and faster convergence speed than the prior arts. A static layered schedule for the 5G low‐density parity‐check codes is proposed here. The proposed static layered schedule provides better error performance and faster convergence speed than state‐of‐the‐art.
ISSN:0013-5194
1350-911X
DOI:10.1049/ell2.13169