ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Wireless Network-Coded Bidirectional Relaying Using Latin Squares for M-PSK Modulation

Muralidharan, Vijayvaradharaj Tirucherai and Namboodiri, Vishnu and Rajan, Sundar B (2013) Wireless Network-Coded Bidirectional Relaying Using Latin Squares for M-PSK Modulation. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 59 (10). pp. 6683-6711.

[img] PDF
Ieee_Tra_Inf_The_59-10_6683_2013.pdf - Published Version
Restricted to Registered users only

Download (7MB) | Request a copy
Official URL: http://dx.doi.org/10.1109/TIT.2013.2268155


The design of modulation schemes for the physical layer network-coded two-way relaying scenario is considered with a protocol which employs two phases: multiple access (MA) phase and broadcast (BC) phase. It was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to the channel conditions greatly reduces the impact of MA interference which occurs at the relay during the MA phase and all these network coding maps should satisfy a requirement called the exclusive law. We show that every network coding map that satisfies the exclusive law is representable by a Latin Square and conversely, that this relationship can be used to get the network coding maps satisfying the exclusive law. The channel fade states for which the minimum distance of the effective constellation at the relay become zero are referred to as the singular fade states. For M - PSK modulation (M any power of 2), it is shown that there are (M-2/4 - M/2 + 1) M singular fade states. Also, it is shown that the constraints which the network coding maps should satisfy so that the harmful effects of the singular fade states are removed, can be viewed equivalently as partially filled Latin Squares (PFLS). The problem of finding all the required maps is reduced to finding a small set of maps for M - PSK constellations (any power of 2), obtained by the completion of PFLS. Even though the completability of M x M PFLS using M symbols is an open problem, specific cases where such a completion is always possible are identified and explicit construction procedures are provided. Having obtained the network coding maps, the set of all possible channel realizations (the complex plane) is quantized into a finite number of regions, with a specific network coding map chosen in a particular region. It is shown that the complex plane can be partitioned into two regions: a region in which any network coding map which satisfies the exclusive law gives the same best performance and a region in which the choice of the network coding map affects the performance. The quantization thus obtained analytically, leads to the same as the one obtained using computer search for M = 4-PSK signal set by Koike-Akino et al., when specialized for Simulation results show that the proposed scheme performs better than the conventional exclusive-OR (XOR) network coding and in some cases outperforms the scheme proposed by Koike-Akino et al.

Item Type: Journal Article
Additional Information: copy right of this article belongs to IEEE Xplore
Keywords: Latin squares; physical layer network coding; wireless bidirectional relaying
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 25 Oct 2013 14:52
Last Modified: 25 Oct 2013 14:52
URI: http://eprints.iisc.ac.in/id/eprint/47569

Actions (login required)

View Item View Item