92,671 research outputs found
Limits on Sparse Data Acquisition: RIC Analysis of Finite Gaussian Matrices
One of the key issues in the acquisition of sparse data by means of
compressed sensing (CS) is the design of the measurement matrix. Gaussian
matrices have been proven to be information-theoretically optimal in terms of
minimizing the required number of measurements for sparse recovery. In this
paper we provide a new approach for the analysis of the restricted isometry
constant (RIC) of finite dimensional Gaussian measurement matrices. The
proposed method relies on the exact distributions of the extreme eigenvalues
for Wishart matrices. First, we derive the probability that the restricted
isometry property is satisfied for a given sufficient recovery condition on the
RIC, and propose a probabilistic framework to study both the symmetric and
asymmetric RICs. Then, we analyze the recovery of compressible signals in noise
through the statistical characterization of stability and robustness. The
presented framework determines limits on various sparse recovery algorithms for
finite size problems. In particular, it provides a tight lower bound on the
maximum sparsity order of the acquired data allowing signal recovery with a
given target probability. Also, we derive simple approximations for the RICs
based on the Tracy-Widom distribution.Comment: 11 pages, 6 figures, accepted for publication in IEEE transactions on
information theor
MIMO Networks: the Effects of Interference
Multiple-input/multiple-output (MIMO) systems promise enormous capacity
increase and are being considered as one of the key technologies for future
wireless networks. However, the decrease in capacity due to the presence of
interferers in MIMO networks is not well understood. In this paper, we develop
an analytical framework to characterize the capacity of MIMO communication
systems in the presence of multiple MIMO co-channel interferers and noise. We
consider the situation in which transmitters have no information about the
channel and all links undergo Rayleigh fading. We first generalize the known
determinant representation of hypergeometric functions with matrix arguments to
the case when the argument matrices have eigenvalues of arbitrary multiplicity.
This enables the derivation of the distribution of the eigenvalues of Gaussian
quadratic forms and Wishart matrices with arbitrary correlation, with
application to both single user and multiuser MIMO systems. In particular, we
derive the ergodic mutual information for MIMO systems in the presence of
multiple MIMO interferers. Our analysis is valid for any number of interferers,
each with arbitrary number of antennas having possibly unequal power levels.
This framework, therefore, accommodates the study of distributed MIMO systems
and accounts for different positions of the MIMO interferers.Comment: Submitted to IEEE Trans. on Info. Theor
Eigenvalue Dynamics of a Central Wishart Matrix with Application to MIMO Systems
We investigate the dynamic behavior of the stationary random process defined
by a central complex Wishart (CW) matrix as it varies along a
certain dimension . We characterize the second-order joint cdf of the
largest eigenvalue, and the second-order joint cdf of the smallest eigenvalue
of this matrix. We show that both cdfs can be expressed in exact closed-form in
terms of a finite number of well-known special functions in the context of
communication theory. As a direct application, we investigate the dynamic
behavior of the parallel channels associated with multiple-input
multiple-output (MIMO) systems in the presence of Rayleigh fading. Studying the
complex random matrix that defines the MIMO channel, we characterize the
second-order joint cdf of the signal-to-noise ratio (SNR) for the best and
worst channels. We use these results to study the rate of change of MIMO
parallel channels, using different performance metrics. For a given value of
the MIMO channel correlation coefficient, we observe how the SNR associated
with the best parallel channel changes slower than the SNR of the worst
channel. This different dynamic behavior is much more appreciable when the
number of transmit () and receive () antennas is similar. However, as
is increased while keeping fixed, we see how the best and worst
channels tend to have a similar rate of change.Comment: 15 pages, 9 figures and 1 table. This work has been accepted for
publication at IEEE Trans. Inf. Theory. Copyright (c) 2014 IEEE. Personal use
of this material is permitted. However, permission to use this material for
any other purposes must be obtained from the IEEE by sending a request to
[email protected]
Deep Learning Framework for Wireless Systems: Applications to Optical Wireless Communications
Optical wireless communication (OWC) is a promising technology for future
wireless communications owing to its potentials for cost-effective network
deployment and high data rate. There are several implementation issues in the
OWC which have not been encountered in radio frequency wireless communications.
First, practical OWC transmitters need an illumination control on color,
intensity, and luminance, etc., which poses complicated modulation design
challenges. Furthermore, signal-dependent properties of optical channels raise
non-trivial challenges both in modulation and demodulation of the optical
signals. To tackle such difficulties, deep learning (DL) technologies can be
applied for optical wireless transceiver design. This article addresses recent
efforts on DL-based OWC system designs. A DL framework for emerging image
sensor communication is proposed and its feasibility is verified by simulation.
Finally, technical challenges and implementation issues for the DL-based
optical wireless technology are discussed.Comment: To appear in IEEE Communications Magazine, Special Issue on
Applications of Artificial Intelligence in Wireless Communication
On the Minimax Capacity Loss under Sub-Nyquist Universal Sampling
This paper investigates the information rate loss in analog channels when the
sampler is designed to operate independent of the instantaneous channel
occupancy. Specifically, a multiband linear time-invariant Gaussian channel
under universal sub-Nyquist sampling is considered. The entire channel
bandwidth is divided into subbands of equal bandwidth. At each time only
constant-gain subbands are active, where the instantaneous subband
occupancy is not known at the receiver and the sampler. We study the
information loss through a capacity loss metric, that is, the capacity gap
caused by the lack of instantaneous subband occupancy information. We
characterize the minimax capacity loss for the entire sub-Nyquist rate regime,
provided that the number of subbands and the SNR are both large. The
minimax limits depend almost solely on the band sparsity factor and the
undersampling factor, modulo some residual terms that vanish as and SNR
grow. Our results highlight the power of randomized sampling methods (i.e. the
samplers that consist of random periodic modulation and low-pass filters),
which are able to approach the minimax capacity loss with exponentially high
probability.Comment: accepted to IEEE Transactions on Information Theory. It has been
presented in part at the IEEE International Symposium on Information Theory
(ISIT) 201
- …