Channel coding and decoding in a relay system operated with physical-layer network coding

This paper investigates link-by-link channel-coded PNC (physical layer network coding), in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes (plus noise), Y 3 = X 1 + X 2 +W 3 , to the network-coded combination of the source...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE journal on selected areas in communications Ročník 27; číslo 5; s. 788 - 796
Hlavní autor: Zhang, Shengli
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.06.2009
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Belief propagation
Bit error rate
Broadcasting
Channel coding
Channels
Coding
Computer numerical control
Decoding
Network coding
Networks
Physical layer
physical layer network coding
Redesign
Relay
Relay systems
Relays
repeat accumulate code
Studies
Transformations
ISSN:0733-8716, 1558-0008
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í:This paper investigates link-by-link channel-coded PNC (physical layer network coding), in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes (plus noise), Y 3 = X 1 + X 2 +W 3 , to the network-coded combination of the source packets, S 1 oplus S 2 . This is in contrast to the traditional multiple-access problem, in which the goal is to obtain both S 1 and S 2 explicitly at the relay node. Trying to obtain S 1 and S 2 explicitly is an overkill if we are only interested in S1oplusS 2 . In this paper, we refer to the transformation Y 3 rarr S 1 oplus S 2 as the channel-decoding- network-coding process (CNC) in that it involves both channel decoding and network coding operations. This paper shows that if we adopt the repeat accumulate (RA) channel code at the two end nodes, then there is a compatible decoder at the relay that can perform the transformation Y 3 rarr S 1 oplusS 2 efficiently. Specifically, we redesign the belief propagation decoding algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC multiple-access channel. Simulation results show that our new scheme outperforms the previously proposed schemes significantly in terms of BER without added complexity.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2009.090618