12,544 research outputs found
Sparse Reconstruction-based Detection of Spatial Dimension Holes in Cognitive Radio Networks
In this paper, we investigate a spectrum sensing algorithm for detecting
spatial dimension holes in Multiple Inputs Multiple Outputs (MIMO)
transmissions for OFDM systems using Compressive Sensing (CS) tools. This
extends the energy detector to allow for detecting transmission opportunities
even if the band is already energy filled. We show that the task described
above is not performed efficiently by regular MIMO decoders (such as MMSE
decoder) due to possible sparsity in the transmit signal. Since CS
reconstruction tools take into account the sparsity order of the signal, they
are more efficient in detecting the activity of the users. Building on
successful activity detection by the CS detector, we show that the use of a
CS-aided MMSE decoders yields better performance rather than using either
CS-based or MMSE decoders separately. Simulations are conducted to verify the
gains from using CS detector for Primary user activity detection and the
performance gain in using CS-aided MMSE decoders for decoding the PU
information for future relaying.Comment: accepted for PIMRC 201
A Generalized Framework on Beamformer Design and CSI Acquisition for Single-Carrier Massive MIMO Systems in Millimeter Wave Channels
In this paper, we establish a general framework on the reduced dimensional
channel state information (CSI) estimation and pre-beamformer design for
frequency-selective massive multiple-input multiple-output MIMO systems
employing single-carrier (SC) modulation in time division duplex (TDD) mode by
exploiting the joint angle-delay domain channel sparsity in millimeter (mm)
wave frequencies. First, based on a generic subspace projection taking the
joint angle-delay power profile and user-grouping into account, the reduced
rank minimum mean square error (RR-MMSE) instantaneous CSI estimator is derived
for spatially correlated wideband MIMO channels. Second, the statistical
pre-beamformer design is considered for frequency-selective SC massive MIMO
channels. We examine the dimension reduction problem and subspace (beamspace)
construction on which the RR-MMSE estimation can be realized as accurately as
possible. Finally, a spatio-temporal domain correlator type reduced rank
channel estimator, as an approximation of the RR-MMSE estimate, is obtained by
carrying out least square (LS) estimation in a proper reduced dimensional
beamspace. It is observed that the proposed techniques show remarkable
robustness to the pilot interference (or contamination) with a significant
reduction in pilot overhead
Empirical Bayes and Full Bayes for Signal Estimation
We consider signals that follow a parametric distribution where the parameter
values are unknown. To estimate such signals from noisy measurements in scalar
channels, we study the empirical performance of an empirical Bayes (EB)
approach and a full Bayes (FB) approach. We then apply EB and FB to solve
compressed sensing (CS) signal estimation problems by successively denoising a
scalar Gaussian channel within an approximate message passing (AMP) framework.
Our numerical results show that FB achieves better performance than EB in
scalar channel denoising problems when the signal dimension is small. In the CS
setting, the signal dimension must be large enough for AMP to work well; for
large signal dimensions, AMP has similar performance with FB and EB.Comment: This work was presented at the Information Theory and Application
workshop (ITA), San Diego, CA, Feb. 201
Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
Despite its reduced complexity, lattice reduction-aided decoding exhibits a
widening gap to maximum-likelihood (ML) performance as the dimension increases.
To improve its performance, this paper presents randomized lattice decoding
based on Klein's sampling technique, which is a randomized version of Babai's
nearest plane algorithm (i.e., successive interference cancelation (SIC)). To
find the closest lattice point, Klein's algorithm is used to sample some
lattice points and the closest among those samples is chosen. Lattice reduction
increases the probability of finding the closest lattice point, and only needs
to be run once during pre-processing. Further, the sampling can operate very
efficiently in parallel. The technical contribution of this paper is two-fold:
we analyze and optimize the decoding radius of sampling decoding resulting in
better error performance than Klein's original algorithm, and propose a very
efficient implementation of random rounding. Of particular interest is that a
fixed gain in the decoding radius compared to Babai's decoding can be achieved
at polynomial complexity. The proposed decoder is useful for moderate
dimensions where sphere decoding becomes computationally intensive, while
lattice reduction-aided decoding starts to suffer considerable loss. Simulation
results demonstrate near-ML performance is achieved by a moderate number of
samples, even if the dimension is as high as 32
Optimum estimation via gradients of partition functions and information measures: a statistical-mechanical perspective
In continuation to a recent work on the statistical--mechanical analysis of
minimum mean square error (MMSE) estimation in Gaussian noise via its relation
to the mutual information (the I-MMSE relation), here we propose a simple and
more direct relationship between optimum estimation and certain information
measures (e.g., the information density and the Fisher information), which can
be viewed as partition functions and hence are amenable to analysis using
statistical--mechanical techniques. The proposed approach has several
advantages, most notably, its applicability to general sources and channels, as
opposed to the I-MMSE relation and its variants which hold only for certain
classes of channels (e.g., additive white Gaussian noise channels). We then
demonstrate the derivation of the conditional mean estimator and the MMSE in a
few examples. Two of these examples turn out to be generalizable to a fairly
wide class of sources and channels. For this class, the proposed approach is
shown to yield an approximate conditional mean estimator and an MMSE formula
that has the flavor of a single-letter expression. We also show how our
approach can easily be generalized to situations of mismatched estimation.Comment: 21 pages; submitted to the IEEE Transactions on Information Theor
- …