519 research outputs found
Reliable Physical Layer Network Coding
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.Comment: 19 pages, 14 figures, survey paper to appear in Proceedings of the
IEE
Coding for Relay Networks with Parallel Gaussian Channels
A wireless relay network consists of multiple source nodes, multiple destination nodes, and possibly many relay nodes in between to facilitate its transmission. It is clear that the performance of such networks highly depends on information for- warding strategies adopted at the relay nodes. This dissertation studies a particular information forwarding strategy called compute-and-forward. Compute-and-forward is a novel paradigm that tries to incorporate the idea of network coding within the physical layer and hence is often referred to as physical layer network coding. The main idea is to exploit the superposition nature of the wireless medium to directly compute or decode functions of transmitted signals at intermediate relays in a net- work. Thus, the coding performed at the physical layer serves the purpose of error correction as well as permits recovery of functions of transmitted signals.
For the bidirectional relaying problem with Gaussian channels, it has been shown by Wilson et al. and Nam et al. that the compute-and-forward paradigm is asymptotically optimal and achieves the capacity region to within 1 bit; however, similar results beyond the memoryless case are still lacking. This is mainly because channels with memory would destroy the lattice structure that is most crucial for the compute-and-forward paradigm. Hence, how to extend compute-and-forward to such channels has been a challenging issue. This motivates this study of the extension of compute-and-forward to channels with memory, such as inter-symbol interference.
The bidirectional relaying problem with parallel Gaussian channels is also studied, which is a relevant model for the Gaussian bidirectional channel with inter-symbol interference and that with multiple-input multiple-output channels. Motivated by the recent success of linear finite-field deterministic model, we first investigate the corresponding deterministic parallel bidirectional relay channel and fully characterize its capacity region. Two compute-and-forward schemes are then proposed for the Gaussian model and the capacity region is approximately characterized to within a constant gap.
The design of coding schemes for the compute-and-forward paradigm with low decoding complexity is then considered. Based on the separation-based framework proposed previously by Tunali et al., this study proposes a family of constellations that are suitable for the compute-and-forward paradigm. Moreover, by using Chinese remainder theorem, it is shown that the proposed constellations are isomorphic to product fields and therefore can be put into a multilevel coding framework. This study then proposes multilevel coding for the proposed constellations and uses multistage decoding to further reduce decoding complexity
Multipair Full-Duplex Relaying with Massive Arrays and Linear Processing
We consider a multipair decode-and-forward relay channel, where multiple
sources transmit simultaneously their signals to multiple destinations with the
help of a full-duplex relay station. We assume that the relay station is
equipped with massive arrays, while all sources and destinations have a single
antenna. The relay station uses channel estimates obtained from received pilots
and zero-forcing (ZF) or maximum-ratio combining/maximum-ratio transmission
(MRC/MRT) to process the signals. To reduce significantly the loop interference
effect, we propose two techniques: i) using a massive receive antenna array; or
ii) using a massive transmit antenna array together with very low transmit
power at the relay station. We derive an exact achievable rate in closed-form
for MRC/MRT processing and an analytical approximation of the achievable rate
for ZF processing. This approximation is very tight, especially for large
number of relay station antennas. These closed-form expressions enable us to
determine the regions where the full-duplex mode outperforms the half-duplex
mode, as well as, to design an optimal power allocation scheme. This optimal
power allocation scheme aims to maximize the energy efficiency for a given sum
spectral efficiency and under peak power constraints at the relay station and
sources. Numerical results verify the effectiveness of the optimal power
allocation scheme. Furthermore, we show that, by doubling the number of
transmit/receive antennas at the relay station, the transmit power of each
source and of the relay station can be reduced by 1.5dB if the pilot power is
equal to the signal power, and by 3dB if the pilot power is kept fixed, while
maintaining a given quality-of-service
Simplified Compute-and-Forward and Its Performance Analysis
The compute-and-forward (CMF) method has shown a great promise as an
innovative approach to exploit interference toward achieving higher network
throughput. The CMF was primarily introduced by means of information theory
tools. While there have been some recent works discussing different aspects of
efficient and practical implementation of CMF, there are still some issues that
are not covered. In this paper, we first introduce a method to decrease the
implementation complexity of the CMF method. We then evaluate the exact outage
probability of our proposed simplified CMF scheme, and hereby provide an upper
bound on the outage probability of the optimum CMF in all SNR values, and a
close approximation of its outage probability in low SNR regimes. We also
evaluate the effect of the channel estimation error (CEE) on the performance of
both optimum and our proposed simplified CMF by simulations. Our simulation
results indicate that the proposed method is more robust against CEE than the
optimum CMF method for the examples considered.Comment: Submitted to IET Communications, 29 pages, 7 figures, 1 table, latex,
The authors are with the Wireless Research Laboratory (WRL), Department of
Electrical Engineering, Sharif University of Technology, Tehran, Ira
Decision-Feedback Detection for Bidirectional Molecular Relaying with Direct Links
In this paper, we consider bidirectional relaying between two diffusion-based
molecular transceivers (bio-nodes). As opposed to existing literature, we
incorporate the effect of direct diffusion links between the nodes and leverage
it to improve performance. Assuming network coding type operation at the relay,
we devise a detection strategy, based on the maximum-likelihood principle, that
combines the signal received from the relay and that received from the direct
link. At the same time, since a diffusion-based molecular communication channel
is characterized by high inter-symbol interference (ISI), we utilize a decision
feedback mechanism to mitigate its effect. Simulation results indicate that the
proposed setup incorporating the direct link can achieve notable improvement in
error performance over conventional detection schemes that do not exploit the
direct link and/or do not attempt to mitigate the effect of ISI
- …