.png){kind=icon}
.png){kind=icon}
Return
Edges metric constrained PEG algorithm for designing LDPC codes
.png){kind=icon}
PRE
AI
DOI：10.23919/JCC.fa.2021-0045.202510.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The progressive edge-growth (PEG) algorithm is a general method to construct short low-density parity-check (LDPC) codes and it is a greedy method to place each edge with large girths. In order to improve the performance of LDPC codes, many improved PEG (IPEG) algorithms employ multi metrics to select surviving edges in turn. In this paper, the proposed edges metric (EM) based on message-passing algorithm (MPA) is introduced to PEG algorithm and the proposed EM constrained PEG (EM-PEG) algorithm mainly considers the independence of message passing from different nodes in Tanner graph. The numerical results show that our EM-PEG algorithm brings better bit error rate (BER) performance gains to LDPC codes than the traditional PEG algorithm and the powerful multi-edge multi-metric constrained PEG algorithm (MM-PEGA) proposed recently. In addition, the multi-edge EM constrained PEG (M-EM-PEG) algorithm which adopts multi-edge EM may further improve the BER performance.
Keywords:
low-density parity-check (LDPC) codes
message-passing algorithm (MPA)
progressive edge-growth (PEG) algorithm
Journal
IF:
3.1
Papers:
1.9K
Citations:
5.0K
Organization
View more organizations