146 research outputs found
Performance Analysis of Adaptive Physical Layer Network Coding for Wireless Two-way Relaying
The analysis of modulation schemes for the physical layer network-coded two
way relaying scenario is presented which employs two phases: Multiple access
(MA) phase and Broadcast (BC) phase. It was shown 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 multiple access interference
which occurs at the relay during the MA phase. Depending on the signal set used
at the end nodes, deep fades occur for a finite number of channel fade states
referred as the singular fade states. The singular fade states fall into the
following two classes: The ones which are caused due to channel outage and
whose harmful effect cannot be mitigated by adaptive network coding are
referred as the \textit{non-removable singular fade states}. The ones which
occur due to the choice of the signal set and whose harmful effects can be
removed by a proper choice of the adaptive network coding map are referred as
the \textit{removable} singular fade states. In this paper, we derive an upper
bound on the average end-to-end Symbol Error Rate (SER), with and without
adaptive network coding at the relay, for a Rician fading scenario. It is shown
that without adaptive network coding, at high Signal to Noise Ratio (SNR), the
contribution to the end-to-end SER comes from the following error events which
fall as : the error events associated with the removable
singular fade states, the error events associated with the non-removable
singular fade states and the error event during the BC phase. In contrast, for
the adaptive network coding scheme, the error events associated with the
removable singular fade states contributing to the average end-to-end SER fall
as and as a result the adaptive network coding scheme
provides a coding gain over the case when adaptive network coding is not used.Comment: 10 pages, 5 figure
Space-Time Coded Spatial Modulated Physical Layer Network Coding for Two-Way Relaying
Using the spatial modulation approach, where only one transmit antenna is
active at a time, we propose two transmission schemes for two-way relay channel
using physical layer network coding with space time coding using Coordinate
Interleaved Orthogonal Designs (CIOD's). It is shown that using two
uncorrelated transmit antennas at the nodes, but using only one RF transmit
chain and space-time coding across these antennas can give a better performance
without using any extra resources and without increasing the hardware
implementation cost and complexity. In the first transmission scheme, two
antennas are used only at the relay, Adaptive Network Coding (ANC) is employed
at the relay and the relay transmits a CIOD Space Time Block Code (STBC). This
gives a better performance compared to an existing ANC scheme for two-way relay
channel which uses one antenna each at all the three nodes. It is shown that
for this scheme at high SNR the average end-to-end symbol error probability
(SEP) is upper bounded by twice the SEP of a point-to-point fading channel. In
the second transmission scheme, two transmit antennas are used at all the three
nodes, CIOD STBC's are transmitted in multiple access and broadcast phases.
This scheme provides a diversity order of two for the average end-to-end SEP
with an increased decoding complexity of for an arbitrary
signal set and for square QAM signal set.Comment: 9 pages, 7 figure
Physical Layer Network Coding for Two-Way Relaying with QAM
The design of modulation schemes for the physical layer network-coded two way
relaying scenario was studied in [1], [3], [4] and [5]. In [7] it was shown
that every network coding map that satisfies the exclusive law is representable
by a Latin Square and conversely, and this relationship can be used to get the
network coding maps satisfying the exclusive law. But, only the scenario in
which the end nodes use -PSK signal sets is addressed in [7] and [8]. In
this paper, we address the case in which the end nodes use -QAM signal sets.
In a fading scenario, for certain channel conditions ,
termed singular fade states, the MA phase performance is greatly reduced. By
formulating a procedure for finding the exact number of singular fade states
for QAM, we show that square QAM signal sets give lesser number of singular
fade states compared to PSK signal sets. This results in superior performance
of -QAM over -PSK. It is shown that the criterion for partitioning the
complex plane, for the purpose of using a particular network code for a
particular fade state, is different from that used for -PSK. Using a
modified criterion, we describe a procedure to analytically partition the
complex plane representing the channel condition. We show that when -QAM () signal set is used, the conventional XOR network mapping fails to remove
the ill effects of , which is a singular fade state for
all signal sets of arbitrary size. We show that a doubly block circulant Latin
Square removes this singular fade state for -QAM.Comment: 13 pages, 14 figures, submitted to IEEE Trans. Wireless
Communications. arXiv admin note: substantial text overlap with
arXiv:1203.326
Distributed Space Time Coding for Wireless Two-way Relaying
We consider the wireless two-way relay channel, in which two-way data
transfer takes place between the end nodes with the help of a relay. For the
Denoise-And-Forward (DNF) protocol, it was shown by Koike-Akino et. al. that
adaptively changing the network coding map used at the relay greatly reduces
the impact of Multiple Access interference at the relay. The harmful effect of
the deep channel fade conditions can be effectively mitigated by proper choice
of these network coding maps at the relay. Alternatively, in this paper we
propose a Distributed Space Time Coding (DSTC) scheme, which effectively
removes most of the deep fade channel conditions at the transmitting nodes
itself without any CSIT and without any need to adaptively change the network
coding map used at the relay. It is shown that the deep fades occur when the
channel fade coefficient vector falls in a finite number of vector subspaces of
, which are referred to as the singular fade subspaces. DSTC
design criterion referred to as the \textit{singularity minimization criterion}
under which the number of such vector subspaces are minimized is obtained.
Also, a criterion to maximize the coding gain of the DSTC is obtained. Explicit
low decoding complexity DSTC designs which satisfy the singularity minimization
criterion and maximize the coding gain for QAM and PSK signal sets are
provided. Simulation results show that at high Signal to Noise Ratio, the DSTC
scheme provides large gains when compared to the conventional Exclusive OR
network code and performs slightly better than the adaptive network coding
scheme proposed by Koike-Akino et. al.Comment: 27 pages, 4 figures, A mistake in the proof of Proposition 3 given in
Appendix B correcte
Wireless Bidirectional Relaying using Physical Layer Network Coding with Heterogeneous PSK Modulation
In bidirectional relaying using Physical Layer Network Coding (PLNC), it is
generally assumed that users employ same modulation schemes in the Multiple
Access phase. However, as observed by Zhang et al., it may not be desirable for
the users to always use the same modulation schemes, particularly when
user-relay channels are not equally strong. Such a scheme is called
Heterogeneous PLNC. However, the approach in [1] uses the computationally
intensive Closest Neighbour Clustering (CNC) algorithm to find the network
coding maps to be applied at the relay. Also, the treatment is specific to
certain cases of heterogeneous modulations. In this paper, we show that, when
users employ heterogeneous but symmetric PSK modulations, the network coding
maps and the mapping regions in the fade state plane can be obtained
analytically. Performance results are provided in terms of Relay Error Rate
(RER) and Bit Error Rate (BER).Comment: 10 pages, 10 figures and 3 table
- …