Elements of information theory
Elements of information theory
Hot topic: physical-layer network coding
Proceedings of the 12th annual international conference on Mobile computing and networking
Joint physical layer coding and network coding for bidirectional relaying
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Computation Over Multiple-Access Channels
IEEE Transactions on Information Theory
Noncoherent physical-layer network coding using binary CPFSK modulation
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Applying physical-layer network coding in wireless networks
EURASIP Journal on Wireless Communications and Networking - Special issue on network coding for wireless networks
Convolutional codes in two-way relay networks with physical-layer network codling
IEEE Transactions on Wireless Communications
Joint power allocation for multicast systems with physical-layer network coding
EURASIP Journal on Wireless Communications and Networking - Special issue on physical-layer network coding for wireless cooperative networks
Buffer-aware network coding for wireless networks
IEEE/ACM Transactions on Networking (TON)
Synchronization Analysis for Wireless TWRC Operated with Physical-layer Network Coding
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
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), Y3 = X1+ X2+W3, to the network-coded combination of the source packets, S1 ⊕ S2. This is in contrast to the traditional multiple-access problem, in which the goal is to obtain both S1 and S2 explicitly at the relay node. Trying to obtain S1 and S2 explicitly is an overkill if we are only interested in S1 ⊕ S2. In this paper, we refer to the transformation Y3 → S1 ⊕ S2 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 Y3 → S1 ⊕ S2 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.