69,458 research outputs found
Zero-rate feedback can achieve the empirical capacity
The utility of limited feedback for coding over an individual sequence of
DMCs is investigated. This study complements recent results showing how limited
or noisy feedback can boost the reliability of communication. A strategy with
fixed input distribution is given that asymptotically achieves rates
arbitrarily close to the mutual information induced by and the
state-averaged channel. When the capacity achieving input distribution is the
same over all channel states, this achieves rates at least as large as the
capacity of the state averaged channel, sometimes called the empirical
capacity.Comment: Revised version of paper originally submitted to IEEE Transactions on
Information Theory, Nov. 2007. This version contains further revisions and
clarification
Random Access Channel Coding in the Finite Blocklength Regime
Consider a random access communication scenario over a channel whose
operation is defined for any number of possible transmitters. Inspired by the
model recently introduced by Polyanskiy for the Multiple Access Channel (MAC)
with a fixed, known number of transmitters, we assume that the channel is
invariant to permutations on its inputs, and that all active transmitters
employ identical encoders. Unlike Polyanskiy, we consider a scenario where
neither the transmitters nor the receiver know which transmitters are active.
We refer to this agnostic communication setup as the Random Access Channel, or
RAC. Scheduled feedback of a finite number of bits is used to synchronize the
transmitters. The decoder is tasked with determining from the channel output
the number of active transmitters () and their messages but not which
transmitter sent which message. The decoding procedure occurs at a time
depending on the decoder's estimate of the number of active transmitters,
, thereby achieving a rate that varies with the number of active
transmitters. Single-bit feedback at each time , enables all
transmitters to determine the end of one coding epoch and the start of the
next. The central result of this work demonstrates the achievability on a RAC
of performance that is first-order optimal for the MAC in operation during each
coding epoch. While prior multiple access schemes for a fixed number of
transmitters require simultaneous threshold rules, the proposed
scheme uses a single threshold rule and achieves the same dispersion.Comment: Presented at ISIT18', submitted to IEEE Transactions on Information
Theor
On Distributed Power Control for Uncoordinated Dual Energy Harvesting Links: Performance Bounds and Near-Optimal Policies
In this paper, we consider a point-to-point link between an energy harvesting
transmitter and receiver, where neither node has the information about the
battery state or energy availability at the other node. We consider a model
where data is successfully delivered only in slots where both nodes are active.
Energy loss occurs whenever one node turns on while the other node is in sleep
mode. In each slot, based on their own energy availability, the transmitter and
receiver need to independently decide whether or not to turn on, with the aim
of maximizing the long-term time-average throughput. We present an upper bound
on the throughput achievable by analyzing a genie-aided system that has
noncausal knowledge of the energy arrivals at both the nodes. Next, we propose
an online policy requiring an occasional one-bit feedback whose throughput is
within one bit of the upper bound, asymptotically in the battery size. In order
to further reduce the feedback required, we propose a time-dilated version of
the online policy. As the time dilation gets large, this policy does not
require any feedback and achieves the upper bound asymptotically in the battery
size. Inspired by this, we also propose a near-optimal fully uncoordinated
policy. We use Monte Carlo simulations to validate our theoretical results and
illustrate the performance of the proposed policies.Comment: 8 page
Scheduling of Multicast and Unicast Services under Limited Feedback by using Rateless Codes
Many opportunistic scheduling techniques are impractical because they require
accurate channel state information (CSI) at the transmitter. In this paper, we
investigate the scheduling of unicast and multicast services in a downlink
network with a very limited amount of feedback information. Specifically,
unicast users send imperfect (or no) CSI and infrequent acknowledgements (ACKs)
to a base station, and multicast users only report infrequent ACKs to avoid
feedback implosion. We consider the use of physical-layer rateless codes, which
not only combats channel uncertainty, but also reduces the overhead of ACK
feedback. A joint scheduling and power allocation scheme is developed to
realize multiuser diversity gain for unicast service and multicast gain for
multicast service. We prove that our scheme achieves a near-optimal throughput
region. Our simulation results show that our scheme significantly improves the
network throughput over schemes employing fixed-rate codes or using only
unicast communications
Opportunistic Relaying in Wireless Networks
Relay networks having source-to-destination pairs and half-duplex
relays, all operating in the same frequency band in the presence of block
fading, are analyzed. This setup has attracted significant attention and
several relaying protocols have been reported in the literature. However, most
of the proposed solutions require either centrally coordinated scheduling or
detailed channel state information (CSI) at the transmitter side. Here, an
opportunistic relaying scheme is proposed, which alleviates these limitations.
The scheme entails a two-hop communication protocol, in which sources
communicate with destinations only through half-duplex relays. The key idea is
to schedule at each hop only a subset of nodes that can benefit from
\emph{multiuser diversity}. To select the source and destination nodes for each
hop, it requires only CSI at receivers (relays for the first hop, and
destination nodes for the second hop) and an integer-value CSI feedback to the
transmitters. For the case when is large and is fixed, it is shown that
the proposed scheme achieves a system throughput of bits/s/Hz. In
contrast, the information-theoretic upper bound of bits/s/Hz
is achievable only with more demanding CSI assumptions and cooperation between
the relays. Furthermore, it is shown that, under the condition that the product
of block duration and system bandwidth scales faster than , the
achievable throughput of the proposed scheme scales as .
Notably, this is proven to be the optimal throughput scaling even if
centralized scheduling is allowed, thus proving the optimality of the proposed
scheme in the scaling law sense.Comment: 17 pages, 8 figures, To appear in IEEE Transactions on Information
Theor
- …