Network coded modulation for two-way relaying

Network coding compresses multiple traffic flows with the aid low-complexity algebraic operations, hence holds the potential of significantly improving both the power and bandwidth efficiency of wireless networks. In this contribution, the novel concept of Network Coded Modulation (NCM) is proposed for jointly performing network coding and modulation in bi-directional/duplex relaying. Each receiver is colocated with a transmitter and hence has prior knowledge of the message intended for the distant receiver. As in classic coded modulation, the Euclidian distance between the symbols is maximized, hence the Symbol Error Ratio (SER) is minimized. Specifically, we conceive NCM methods for PSK, PAM and QAM based on modulo addition of the normalized phase or amplitude. Furthermore, we propose low complexity decoding algorithms based on the corresponding conditional minimum distance criteria. Our performance analysis and simulations demonstrate that NCM relying on PSK is capable of achieving a SER at both receivers of the NCM scheme as if the relay transmitted exclusively to a single receiver only. By contrast, when our NCM concept is combined with PAM/QAM, an SNR loss (<1.25dB) is imposed at one of the receivers, usually at the one having a lower data rate in a realistic different rate scenario. Finally, we will demonstrate that the proposed NCM is compatible with existing physical layer designs

Superposition Coding Aided Bi-directional Relay Transmission Employing Iteratively Decoded Self-Concatenated Convolutional Codes

In this paper, we consider coding schemes designed for two nodes communicating with each other with the aid of a relay node, which receives information from the two nodes in the first time slot. At the relay node we combine a powerful Superposition Coding (SPC) scheme with Iteratively Decoded Self-Concatenated Convolutional Codes (SECCC-ID), which exchange mutual information between each other. It is assumed that decoding errors may be encountered at the relay node. The relay node then broadcasts this information in the second time slot after re-encoding it, again, using a SECCC encoder. At the destination, an amalgamated SPC-SECCC block then detects and decodes the signal either with or without the aid of a priori information. Our simulation results demonstrate that the proposed scheme is capable of reliably operating at a low BER for transmission over both AWGN and uncorrelated Rayleigh fading channels. We compare the proposed scheme’s performance to a direct transmission link between the two sources having the same throughput. Additionally, the SPC-SECCC system achieves a low BER even for realistic error-infested relaying

Pairwise Check Decoding for LDPC Coded Two-Way Relay Block Fading Channels

Partial decoding has the potential to achieve a larger capacity region than full decoding in two-way relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian channels and with a static physical layer network coding (PLNC). In this paper, we propose a new solution for joint network coding and channel decoding at the relay, called pairwise check decoding (PCD), for low-density parity-check (LDPC) coded TWR system over block fading channels. The main idea is to form a check relationship table (check-relation-tab) for the superimposed LDPC coded packet pair in the multiple access (MA) phase in conjunction with an adaptive PLNC mapping in the broadcast (BC) phase. Using PCD, we then present a partial decoding method, two-stage closest-neighbor clustering with PCD (TS-CNC-PCD), with the aim of minimizing the worst pairwise error probability. Moreover, we propose the minimum correlation optimization (MCO) for selecting the better check-relation-tabs. Simulation results confirm that the proposed TS-CNC-PCD offers a sizable gain over the conventional XOR with belief propagation (BP) in fading channels.Comment: to appear in IEEE Trans. on Communications, 201

Maximum Euclidean distance network coded modulation for asymmetric decode-and-forward two-way relaying

Network coding (NC) compresses two traffic flows with the aid of low-complexity algebraic operations, hence holds the potential of significantly improving both the efficiency of wireless two-way relaying, where each receiver is collocated with a transmitter and hence has prior knowledge of the message intended for the distant receiver. In this contribution, network coded modulation (NCM) is proposed for jointly performing NC and modulation. As in classic coded modulation, the Euclidean distance between the symbols is maximised, hence the symbol error probability is minimised. Specifically, the authors first propose set-partitioning-based NCM as an universal concept which can be combined with arbitrary constellations. Then the authors conceive practical phase-shift keying/quadrature amplitude modulation (PSK/QAM) NCM schemes, referred to as network coded PSK/QAM, based on modulo addition of the normalised phase/amplitude. To achieve a spatial diversity gain at a low complexity, a NC oriented maximum ratio combining scheme is proposed for combining the network coded signal and the original signal of the source. An adaptive NCM is also proposed to maximise the throughput while guaranteeing a target bit error probability (BEP). Both theoretical performance analysis and simulations demonstrate that the proposed NCM can achieve at least 3 dB signal-to-noise ratio gain and two times diversity gain

Performance Bounds for Bi-Directional Coded Cooperation Protocols

In coded bi-directional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this paper, we derive performance bounds for this problem for each of three protocols. The first protocol is a two phase protocol were both users simultaneously transmit during the first phase and the relay alone transmits during the second. In this protocol, our bounds are tight and a multiple-access channel transmission from the two users to the relay followed by a coded broadcast-type transmission from the relay to the users achieves all points in the two-phase capacity region. The second protocol considers sequential transmissions from the two users followed by a transmission from the relay while the third protocol is a hybrid of the first two protocols and has four phases. In the latter two protocols the inner and outer bounds are not identical, and differ in a manner similar to the inner and outer bounds of Cover's relay channel. Numerical evaluation shows that at least in some cases of interest our bounds do not differ significantly. Finally, in the Gaussian case with path loss, we derive achievable rates and compare the relative merits of each protocol in various regimes. This case is of interest in cellular systems. Surprisingly, we find that in some cases, the achievable rate region of the four phase protocol sometimes contains points that are outside the outer bounds of the other protocols.Comment: 15 page