We present a new architecture to handle the ongoing explosive increase in the
demand for video content in wireless networks. It is based on distributed
caching of the content in femto-basestations with small or non-existing
backhaul capacity but with considerable storage space, called helper nodes. We
also consider using the mobile terminals themselves as caching helpers, which
can distribute video through device-to-device communications. This approach
allows an improvement in the video throughput without deployment of any
additional infrastructure.
We study the problem of storing a data object in a set of data nodes that
fail independently with given probabilities. Our problem is a natural
generalization of a homogenous storage allocation problem where all the nodes
had the same reliability and is naturally motivated for peer-to-peer and cloud
storage systems with different types of nodes. Assuming optimal erasure coding
(MDS), the goal is to find a storage allocation (i.e, how much to store in each
node) to maximize the probability of successful recovery. This problem turns
out to be a challenging combinatorial optimization problem.
We consider a distributed antenna system where $L$ antenna terminals (ATs)
are connected to a Central Processor (CP) via digital error-free links of
finite capacity $R_0$, and serve $L$ user terminals (UTs). This system model
has been widely investigated both for the uplink and the downlink, which are
instances of the general multiple-access relay and broadcast relay networks. In
this work we focus on the downlink, and propose a novel downlink precoding
scheme nicknamed "Reverse Quantized Compute and Forward" (RQCoF).
Conventional MU-MIMO techniques, e.g. Linear Zero-Forced Beamforming (LZFB),
require sufficiently accurate channel state information at the transmitter
(CSIT) in order to realize spectral efficient transmission (degree of freedom
gains).
We suggest a novel approach to handle the ongoing explosive increase in the
demand for video content in wireless/mobile devices. We envision femtocell-like
base stations, which we call helpers, with weak backhaul links but large
storage capacity. These helpers form a wireless distributed caching network
that assists the macro base station by handling requests of popular files that
have been cached. Due to the short distances between helpers and requesting
devices, the transmission of cached files can be done very efficiently.
The main focus and contribution of this paper is a novel network-MIMO TDD
architecture that achieves spectral efficiencies comparable with "Massive
MIMO", with one order of magnitude fewer antennas per active user per cell. The
proposed architecture is based on a family of network-MIMO schemes defined by
small clusters of cooperating base stations, zero-forcing multiuser MIMO
precoding with suitable inter-cluster interference constraints, uplink pilot
signals reuse across cells, and frequency reuse.
We revisit a recent result by Etkin, Tse, and Wang on achieving the capacity
of the Gaussian interference channel to within one bit using a fixed
Han-Kobayashi message splitting strategy. In particular, we show that the one
bit gap is not always attainable, specifically on the corners of the rate
region, by using a fixed power splitting scheme. The one-bit gap result is
proved by comparing an achievable rate region due to Chong et al. (also known
as the CMG region) with new upper bounds for the capacity region derived by
Etkin, Tse, and Wang.
Reminiscent of the parity function in network coding for the butterfly
network, it is shown that forwarding an even/odd indicator bit for a scalar
quantization of a relay observation recovers 1 bit of information at the two
destinations in a noiseless interference channel where interference is treated
as noise. Based on this observation, a coding strategy is proposed to improve
the rate of both users at the same time using a relay node in an interference
channel.
We consider the problem of designing low latency and low complexity schemes
for channel state feedback over the MIMO-MAC (multiple-input multiple-output
multiple access channel). We develop a framework for analyzing this problem in
terms of minimizing the MSE distortion, and come up with separated
source-channel schemes and joint source-channel schemes that perform better
than analog feedback.
We find the capacity region of linear finite-field deterministic networks
with many sources and one destination. Nodes in the network are subject to
interference and broadcast constraints, specified by the linear finite-field
deterministic model. Each node can inject its own information as well as relay
other nodes' information. We show that the capacity region coincides with the
cut-set region. Also, for a specific case of correlated sources we provide
necessary and sufficient conditions for the sources transmissibility.
User scheduling and multiuser multi-antenna (MU-MIMO) transmission are at the
core of high rate data-oriented downlink schemes of the next-generation of
cellular systems (e.g., LTE-Advanced). Scheduling selects groups of users
according to their channels vector directions and SINR levels. However, when
scheduling is applied independently in each cell, the inter-cell interference
(ICI) power at each user receiver is not known in advance since it changes at
each new scheduling slot depending on the scheduling decisions of all
interfering base stations.
We consider the downlink of a cellular network with multiple cells and
multi-antenna base stations including arbitrary inter-cell cooperation,
realistic distance-dependent pathloss and general "fairness" requirements.
Beyond Monte Carlo simulation, no efficient computation method to evaluate the
ergodic throughput of such systems has been provided so far. We propose a
method based on the combination of some large random matrix results with
Lagrangian optimization.
We consider a MIMO fading broadcast channel where the fading channel
coefficients are constant over time-frequency blocks that span a coherent time
$\times$ a coherence bandwidth. In closed-loop systems, channel state
information at transmitter (CSIT) is acquired by the downlink training sent by
the base station and an explicit feedback from each user terminal. In open-loop
systems, CSIT is obtained by exploiting uplink training and channel
reciprocity.
The optimization of the transmitter precoder (steering vectors and power
allocation) for a MIMO Broadcast Channel (MIMO-BC) subject to general linear
constraints is considered. These include various types of system constraints
such as sum power, per-antenna or per-group-of-antennas power constraints, and
"forbidden interference direction" constraints. We consider the transmitter
optimization problem under either the optimal dirty-paper coding and the simple
suboptimal linear zero-forcing beamforming strategies.