.png){kind=icon}
返回
Low Complexity Majority-Logic Decoding for LDPC-Coded PNC Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2022.3151770.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this letter, we propose majority-logic decoding (MLGD) algorithms of low complexity for low-density parity-check (LDPC) coded physical-layer network coding (PNC) in a two-way relay channel (TWRC). In particular, we decode the transmit combination of two-user messages from the superimposed signal and then map the XOR message of two users. By exploiting the superposition rules of PNC, we develop hard decision-based and reliability-based decoding algorithms, i.e., modified one-step MLGD (M-OSMLGD) and iterative soft reliability-based decoding (M-ISRB), to iteratively update the combination of two-user messages. Moreover, we propose an improved M-ISRB (IM-ISRB) decoding to update the external reliability of the combination of two-user messages in each iteration. Simulation results show that the proposed decoding algorithms can achieve effective an trade-off between complexity and decoding performance for LDPC-coded PNC systems.
Keyword:
Iterative decoding
Reliability
Decoding
Relays
Complexity theory
Network coding
Simulation
Physical network coding
relay
low-density parity-check codes
majority logic decoding
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏Protograph LDPC-Coded BICM-ID With Irregular CSK Mapping in Visible Light Communication Systems
PREAI
分享收藏
查看更多内容