32,496 research outputs found
Recommended from our members
Capacity bounds for some Gaussian interference channels
In current wireless networks, co-channel interference is the major limiting factor in achieving high spectral efficiency. The effective interference at receivers can be minimized by using advanced interference management techniques. Given channel conditions, what is the fundamental limit on maximum spectral efficiency we can achieve, and which encoding and decoding techniques achieve this limit? These research questions can be addressed as network information theory problems. In particular, the capacity of Gaussian interference channels is an important open problem dealing with these fundamental questions. Some special cases of the interference channels and their capacity regions are studied in this dissertation.
For a class of partially connected interference channels, approximate capacity regions are characterized. The impact of topology, interference alignment, and the interplay between interference and noise are discussed. The results show that for these channels, genie-aided outer bounds are tight to within a constant gap from capacity. Near-optimal achievable schemes, based on rate-splitting and lattice alignment, are presented.
The Gaussian X-channel is also an important Gaussian interference channel model. Lower and upper bounds on the sum-rate capacity are derived for this channel. The achievable schemes are based on layered lattice coding and compute-and-forward decoding. For different regimes of channel parameters, some combinations of encoding and decoding strategies are designed. For some range of channel parameters, the approximate sum-rate capacity is characterized to within a constant gap.Electrical and Computer Engineerin
A digital interface for Gaussian relay and interference networks: Lifting codes from the discrete superposition model
For every Gaussian network, there exists a corresponding deterministic
network called the discrete superposition network. We show that this discrete
superposition network provides a near-optimal digital interface for operating a
class consisting of many Gaussian networks in the sense that any code for the
discrete superposition network can be naturally lifted to a corresponding code
for the Gaussian network, while achieving a rate that is no more than a
constant number of bits lesser than the rate it achieves for the discrete
superposition network. This constant depends only on the number of nodes in the
network and not on the channel gains or SNR. Moreover the capacities of the two
networks are within a constant of each other, again independent of channel
gains and SNR. We show that the class of Gaussian networks for which this
interface property holds includes relay networks with a single
source-destination pair, interference networks, multicast networks, and the
counterparts of these networks with multiple transmit and receive antennas.
The code for the Gaussian relay network can be obtained from any code for the
discrete superposition network simply by pruning it. This lifting scheme
establishes that the superposition model can indeed potentially serve as a
strong surrogate for designing codes for Gaussian relay networks.
We present similar results for the K x K Gaussian interference network, MIMO
Gaussian interference networks, MIMO Gaussian relay networks, and multicast
networks, with the constant gap depending additionally on the number of
antennas in case of MIMO networks.Comment: Final versio
Optimality of Treating Interference as Noise: A Combinatorial Perspective
For single-antenna Gaussian interference channels, we re-formulate the
problem of determining the Generalized Degrees of Freedom (GDoF) region
achievable by treating interference as Gaussian noise (TIN) derived in [3] from
a combinatorial perspective. We show that the TIN power control problem can be
cast into an assignment problem, such that the globally optimal power
allocation variables can be obtained by well-known polynomial time algorithms.
Furthermore, the expression of the TIN-Achievable GDoF region (TINA region) can
be substantially simplified with the aid of maximum weighted matchings. We also
provide conditions under which the TINA region is a convex polytope that relax
those in [3]. For these new conditions, together with a channel connectivity
(i.e., interference topology) condition, we show TIN optimality for a new class
of interference networks that is not included, nor includes, the class found in
[3].
Building on the above insights, we consider the problem of joint link
scheduling and power control in wireless networks, which has been widely
studied as a basic physical layer mechanism for device-to-device (D2D)
communications. Inspired by the relaxed TIN channel strength condition as well
as the assignment-based power allocation, we propose a low-complexity
GDoF-based distributed link scheduling and power control mechanism (ITLinQ+)
that improves upon the ITLinQ scheme proposed in [4] and further improves over
the heuristic approach known as FlashLinQ. It is demonstrated by simulation
that ITLinQ+ provides significant average network throughput gains over both
ITLinQ and FlashLinQ, and yet still maintains the same level of implementation
complexity. More notably, the energy efficiency of the newly proposed ITLinQ+
is substantially larger than that of ITLinQ and FlashLinQ, which is desirable
for D2D networks formed by battery-powered devices.Comment: A short version has been presented at IEEE International Symposium on
Information Theory (ISIT 2015), Hong Kon
- …