8,838 research outputs found
On Capacity Regions of Discrete Asynchronous Multiple Access Channels
A general formalization is given for asynchronous multiple access channels
which admits different assumptions on delays. This general framework allows the
analysis of so far unexplored models leading to new interesting capacity
regions. In particular, a single letter characterization is given for the
capacity region in case of 3 senders, 2 synchronous with each other and the
third not synchronous with them.Comment: It has been presented in part at ISIT 2011, Saint Petersburg. This
extended version is accepted for publication in Kybernetik
On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels
The asynchronous capacity region of memoryless multiple-access channels is
the union of certain polytopes. It is well-known that vertices of such
polytopes may be approached via a technique called successive decoding. It is
also known that an extension of successive decoding applies to the dominant
face of such polytopes. The extension consists of forming groups of users in
such a way that users within a group are decoded jointly whereas groups are
decoded successively. This paper goes one step further. It is shown that
successive decoding extends to every face of the above mentioned polytopes. The
group composition as well as the decoding order for all rates on a face of
interest are obtained from a label assigned to that face. From the label one
can extract a number of structural properties, such as the dimension of the
corresponding face and whether or not two faces intersect. Expressions for the
the number of faces of any given dimension are also derived from the labels.Comment: 21 pages, 5 figures and 1 table. Submitted to IEEE Transactions on
Information Theor
Energy-Efficient Communication over the Unsynchronized Gaussian Diamond Network
Communication networks are often designed and analyzed assuming tight
synchronization among nodes. However, in applications that require
communication in the energy-efficient regime of low signal-to-noise ratios,
establishing tight synchronization among nodes in the network can result in a
significant energy overhead. Motivated by a recent result showing that
near-optimal energy efficiency can be achieved over the AWGN channel without
requiring tight synchronization, we consider the question of whether the
potential gains of cooperative communication can be achieved in the absence of
synchronization. We focus on the symmetric Gaussian diamond network and
establish that cooperative-communication gains are indeed feasible even with
unsynchronized nodes. More precisely, we show that the capacity per unit energy
of the unsynchronized symmetric Gaussian diamond network is within a constant
factor of the capacity per unit energy of the corresponding synchronized
network. To this end, we propose a distributed relaying scheme that does not
require tight synchronization but nevertheless achieves most of the energy
gains of coherent combining.Comment: 20 pages, 4 figures, submitted to IEEE Transactions on Information
Theory, presented at IEEE ISIT 201
- …