Low Complexity Majority-Logic Decoding for LDPC-Coded PNC Systems

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 26; číslo 5; s. 959 - 963
Hlavní autoři: Xie, Xiaoqian, Chen, Pingping, Fang, Yi, Xie, Zhaopeng
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.05.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Codes
Complexity
Complexity theory
Decoding
Error correcting codes
Iterative decoding
low-density parity-check codes
majority logic decoding
Messages
Network coding
Physical network coding
relay
Relays
Reliability
Simulation
System effectiveness
ISSN:1089-7798, 1558-2558
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2022.3151770