1,148 research outputs found
Joint Source-Channel Coding over a Fading Multiple Access Channel with Partial Channel State Information
In this paper we address the problem of transmission of correlated sources
over a fast fading multiple access channel (MAC) with partial channel state
information available at both the encoders and the decoder. We provide
sufficient conditions for transmission with given distortions. Next these
conditions are specialized to a Gaussian MAC (GMAC). We provide the optimal
power allocation strategy and compare the strategy with various levels of
channel state information.
Keywords: Fading MAC, Power allocation, Partial channel state information,
Correlated sources.Comment: 7 Pages, 3 figures. To Appear in IEEE GLOBECOM, 200
How to Compute Modulo Prime-Power Sums
The problem of computing modulo prime-power sums is investigated in
distributed source coding as well as computation over Multiple-Access Channel
(MAC). We build upon group codes and present a new class of codes called Quasi
Group Codes (QGC). A QGC is a subset of a group code. These codes are not
closed under the group addition. We investigate some properties of QGC's, and
provide a packing and a covering bound. Next, we use these bounds to derived
achievable rates for distributed source coding as well as computation over MAC.
We show that strict improvements over the previously known schemes can be
obtained using QGC's
Capacity Bounds for a Class of Diamond Networks
A class of diamond networks are studied where the broadcast component is
modelled by two independent bit-pipes. New upper and low bounds are derived on
the capacity which improve previous bounds. The upper bound is in the form of a
max-min problem, where the maximization is over a coding distribution and the
minimization is over an auxiliary channel. The proof technique generalizes
bounding techniques of Ozarow for the Gaussian multiple description problem
(1981), and Kang and Liu for the Gaussian diamond network (2011). The bounds
are evaluated for a Gaussian multiple access channel (MAC) and the binary adder
MAC, and the capacity is found for interesting ranges of the bit-pipe
capacities
Asymptotic Analysis of Double-Scattering Channels
We consider a multiple-input multiple-output (MIMO) multiple access channel
(MAC), where the channel between each transmitter and the receiver is modeled
by the doubly-scattering channel model. Based on novel techniques from random
matrix theory, we derive deterministic approximations of the mutual
information, the signal-to-noise-plus-interference-ratio (SINR) at the output
of the minimum-mean-square-error (MMSE) detector and the sum-rate with MMSE
detection which are almost surely tight in the large system limit. Moreover, we
derive the asymptotically optimal transmit covariance matrices. Our simulation
results show that the asymptotic analysis provides very close approximations
for realistic system dimensions.Comment: 5 pages, 2 figures, submitted to the Annual Asilomar Conference on
Signals, Systems, and Computers, Pacific Grove, CA, USA, 201
- …