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

Zhang, Peng-Wei; Lau, Francis C. M.; Sham, Chiu-Wing

doi:10.1109/lcomm.2021.3057717

Cited by 6 publications

(27 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…That is to say, the decoding convergence speed of protograph LDPC codes is slow. At present, [24] and [25] focus on the decoding algorithm of protograph LDPC codes. However, for these algorithms, the number of iterations to converge to the ideal performance is still large.…”

Section: Rpd For Protograph Ldpc Codesmentioning

confidence: 99%

A Reliability Profile Based Low-Complexity Dynamic Schedule LDPC Decoding

2022

View full text Add to dashboard Cite

In order to improve the error correction performance of Low-Density Parity-Check (LDPC) codes, In this paper, we propose a Reliability Profile (RP) Based Low-Complexity Dynamic Schedule, called RPD. In terms of dynamic scheduling, the new RPD method is distinct from the existing residual belief propagation (RBP) and its variations, since RPD is based on residual criterion. Reliability divides nodes message into two categories: reliable and unreliable. By using as many messages as possible from the latest available current iteration instead of the previous iteration to update unreliable messages multiple times to speed up the convergence speed and increase the total number of updates of effective nodes message, so as to improve the Bit Error Rate (BER) performance. By not updating the reliable message, the number of ineffective nodes message updates is reduced, thereby reducing the decoding complexity. Besides, the more iterations increase, the fewer calculations of these reliable nodes. Moreover, based on reliability profile, RPD has an advantage over RBP for dynamic scheduling in that the former only needs integer operations, while the latter requires float operations. Therefore, the RPD algorithm not only accelerates the convergence speed of LDPC decoding and but also improves the BER performance while reducing the complexity.The analysis and simulation results show that the RPD strategy not only retains the fast-convergence advantage of RBP, but also has a better convergence BER performance compared to that of node-wise residual belief propagation (NW RBP). Furthermore, the simulation results show that the RPD can significantly improve the convergence speed of protograph LDPC decoding.

show abstract

Section: Rpd For Protograph Ldpc Codesmentioning

confidence: 99%

A Reliability Profile Based Low-Complexity Dynamic Schedule LDPC Decoding

2022

View full text Add to dashboard Cite

show abstract

“…The structure of a PLDPC-HC can be constructed from a PLDPC code [16]. When the check nodes in a PLDPC code are replaced by Hadamard check-nodes (H-CNs) to which an appropriate number of degree-1 Hadamard variable nodes (D1H-VNs) are connected, a PLDPC-HC is formed [28], [29]. Fig.…”

Section: Review Of Pldpc-hadamard Codesmentioning

confidence: 99%

“…1 0 0 0 0 0 1 0 3 0 1 0 1 2 0 0 0 0 0 0 2 1 2 1 0 0 1 1 0 0 0 0 1 0 1 0 3 0 0 0 0 0 2 0 2 0 0 0 0 0 0 1 0 3 0 3 0 0 2 0 0 1 0 0 0 0 1 0 0 1 1 0 0 0 1 2 0 1. The base matrix and corresponding protograph of a PLDPC-Hadamard code [28], [29]. A circle denotes a protograph variable node (P-VN), a square with "H" denotes a Hadamard check node (H-CN), and a filled circle denotes a degree and decoding [32].…”

Section: Review Of Pldpc-hadamard Codesmentioning

confidence: 99%

“…Recently, a new type of LDPC-HCs called protograph-based LDPC Hadamard codes (PLDPC-HCs) have been proposed, and a new technique is developed to enable the analysis of PLDPC-HCs which possess degree-1 and/or punctured variable nodes [28], [29]. PLDPC-HCs perform DRAFT as good as traditional LDPC-HCs.…”

Section: Introductionmentioning

confidence: 99%

“…In addition, PLDPC-HC possesses a semi-regular 1 quasi-cyclic structure which is beneficial to hardware implementation. To improve the convergence rate, a PLDPC-HC layered decoding algorithm has been proposed [30]. In this paper, we propose a hardware architecture for PLDPC-HC layered decoders.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Hardware Architecture of Layered Decoders for PLDPC-Hadamard Codes

Zhang¹,

Lau²,

Sham³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Protograph-based low-density parity-check Hadamard codes (PLDPC-HCs) are a new type of ultimate-Shannon-limit-approaching codes. In this paper, we propose a hardware architecture for the PLDPC-HC layered decoders. The decoders consist mainly of random address memories, Hadamard sub-decoders and control logics. Two types of pipelined structures are presented and the latency and throughput of these two structures are derived. Implementation of the decoder design on an FPGA board shows that a throughput of 1.48 Gbps is achieved with a bit error rate (BER) of 10 −5 at around E b /N 0 = −0.40 dB. The decoder can also achieve the same BER at E b /N 0 = −1.11 dB with a reduced throughput of 0.20 Gbps.

show abstract

Construction of Protograph-Based Partially Doped Generalized LDPC Codes

Kim

Kwak

et al. 2022

IEEE Access

View full text Add to dashboard Cite

In this paper, we propose a new code design technique, called partial doping, for protographbased generalized low-density parity-check (GLDPC) codes. While the conventional construction method of protograph-based GLDPC codes is to replace some single parity-check (SPC) nodes with generalized constraint (GC) nodes applying to multiple variable nodes (VNs) that are connected in the protograph, the proposed technique can select any VNs in the protograph to be protected by GC nodes. In other words, the partial doping technique facilitates finer tuning of doping, which in turn enables a sophisticated code optimization with higher degree of freedom. We construct the proposed partially doped GLDPC (PD-GLDPC) codes using the partial doping technique and optimize the PD-GLDPC codes by the protograph extrinsic information transfer (PEXIT) analysis. In addition, we propose a condition guaranteeing the linear minimum distance growth of the PD-GLDPC codes and use the condition for the optimization. Experimental results show that the optimized PD-GLDPC codes outperform the conventional GLDPC codes and have competitive performance compared to the state-of-the-art protograph-based LDPC codes without the error floor phenomenon over the binary erasure channel (BEC).INDEX TERMS Generalized low-density parity-check (GLDPC) codes, partial doping, partially doped GLDPC (PD-GLDPC) codes, protograph, protograph extrinsic information transfer (PEXIT), typical minimum distance.

show abstract

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

Cited by 6 publications

References 11 publications

A Reliability Profile Based Low-Complexity Dynamic Schedule LDPC Decoding

A Reliability Profile Based Low-Complexity Dynamic Schedule LDPC Decoding

Hardware Architecture of Layered Decoders for PLDPC-Hadamard Codes

Construction of Protograph-Based Partially Doped Generalized LDPC Codes

Contact Info

Product

Resources

About