Results 1 - 10
of
21
Reliable physical layer network coding
- Proceedings of the IEEE
, 2011
"... Abstract—When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted interference. This property of the wireless medium is ..."
Abstract
-
Cited by 55 (6 self)
- Add to MetaCart
(Show Context)
Abstract—When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted interference. This property of the wireless medium is typically viewed as a hindrance to reliable communication over a network. However, using a recently developed coding strategy, interference can in fact be harnessed for network coding. In a wired network, (linear) network coding refers to each intermediate node taking its received packets, computing a linear combination over a finite field, and forwarding the outcome towards the destinations. Then, given an appropriate set of linear combinations, a destination can solve for its desired packets. For certain topologies, this strategy can attain significantly higher throughputs over routing-based strategies. Reliable physical layer network coding takes this idea one step further: using judiciously chosen linear error-correcting codes, intermediate nodes in a wireless network can directly recover linear combinations of the packets from the observed noisy superpositions of transmitted signals. Starting with some simple examples, this survey explores the core ideas behind this new technique and the possibilities it offers for communication over interference-limited wireless networks. Index Terms—Digital communication, wireless networks, in-terference, network coding, channel coding, linear code, modula-tion, physical layer, fading, multiuser channels, multiple access, broadcast. I.
Channel quantization for physical layer network-coded two-way relaying
- in Proc. IEEE WCNC
, 2012
"... Abstract—The design of modulation schemes for the physical layer network-coded two way relaying scenario is considered with the 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 ma ..."
Abstract
-
Cited by 9 (7 self)
- Add to MetaCart
Abstract—The design of modulation schemes for the physical layer network-coded two way relaying scenario is considered with the 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 multiple access interference which occurs at the relay during the MA phase. In other words, the set of all possible channel realizations (the complex plane) is quantized into a finite number of regions, with a specific network coding map giving the best performance in a particular region. We highlight the issues associated with the scheme proposed by Koike-Akino et al. and propose a scheme which solves these issues. We obtain a quantization of the set of all possible channel realizations analytically for the case when M-PSK (for M any
Physical layer network coding for two-way relaying with QAM
- Wireless Communications, IEEE Transactions on
, 2013
"... ar ..."
(Show Context)
Multistage compute-and-forward with multilevel lattice codes based on product constructions
- in Proc. IEEE ISIT
, 2014
"... ar ..."
(Show Context)
Wireless Network-Coded Bidirectional Relaying using Latin Squares for M-PSK Modulation
, 2013
"... 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 ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
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 multiple access 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
On modulo-sum computation over an erasure multiple access channel
- in Prodeedings. IEEE International Symposium on Information Theory (ISIT), 2012
"... ar ..."
(Show Context)
Wireless Network Coding for MIMO Two-way Relaying using Latin Rectangles
"... Abstract—The design of modulation schemes for the physical layer network-coded two-way MIMO relaying scenario is considered, with the denoise-and-forward (DNF) protocol which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. It is shown that for MIMO two-way relaying, deep fad ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Abstract—The design of modulation schemes for the physical layer network-coded two-way MIMO relaying scenario is considered, with the denoise-and-forward (DNF) protocol which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. It is shown that for MIMO two-way relaying, deep fade occurs at the relay when the row space of the channel fade coefficient matrix is a subspace of a finite number of vector subspaces which are referred to as the singular fade subspaces. It is shown that proper choice of network coding map obtained by the completion of appropriate partially filled Latin Rectangle can remove most of the singular fade subspaces, referred to as the removable singular fade subspaces. For 2 λ-PSK signal set, the number of removable and non-removable singular fade subspaces are obtained analytically and it is shown that the number of nonremovable singular fade subspaces is a small fraction of the total
Wireless Network-Coded Three-Way Relaying using Latin Cubes, available online at arXiv:1112.1584v3 [cs.IT
, 2012
"... ar ..."
(Show Context)
Performance Analysis of Adaptive Physical Layer Network Coding for Wireless Two-way Relaying
- IEEE 23RD INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS- (PIMRC)
, 2012
"... 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. Depending on the signal set used at the end nodes, the minimum distance of the effective constellation seen at ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
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. Depending on the signal set used at the end nodes, the minimum distance of the effective constellation seen at the relay becomes zero for a finite number of channel fade states referred as the singular fade states. The singular fade states fall into the following two classes: (i) the ones which are caused due to channel outage and whose harmful effect cannot be mitigated by adaptive network coding called the non-removable singular fade states and (ii) the ones which occur due to the choice of the signal set and whose harmful effects can be removed called the 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
