833 research outputs found
Estimation of Sparse MIMO Channels with Common Support
We consider the problem of estimating sparse communication channels in the
MIMO context. In small to medium bandwidth communications, as in the current
standards for OFDM and CDMA communication systems (with bandwidth up to 20
MHz), such channels are individually sparse and at the same time share a common
support set. Since the underlying physical channels are inherently
continuous-time, we propose a parametric sparse estimation technique based on
finite rate of innovation (FRI) principles. Parametric estimation is especially
relevant to MIMO communications as it allows for a robust estimation and
concise description of the channels. The core of the algorithm is a
generalization of conventional spectral estimation methods to multiple input
signals with common support. We show the application of our technique for
channel estimation in OFDM (uniformly/contiguous DFT pilots) and CDMA downlink
(Walsh-Hadamard coded schemes). In the presence of additive white Gaussian
noise, theoretical lower bounds on the estimation of SCS channel parameters in
Rayleigh fading conditions are derived. Finally, an analytical spatial channel
model is derived, and simulations on this model in the OFDM setting show the
symbol error rate (SER) is reduced by a factor 2 (0 dB of SNR) to 5 (high SNR)
compared to standard non-parametric methods - e.g. lowpass interpolation.Comment: 12 pages / 7 figures. Submitted to IEEE Transactions on Communicatio
Sub-Nanosecond Time of Flight on Commercial Wi-Fi Cards
Time-of-flight, i.e., the time incurred by a signal to travel from
transmitter to receiver, is perhaps the most intuitive way to measure distances
using wireless signals. It is used in major positioning systems such as GPS,
RADAR, and SONAR. However, attempts at using time-of-flight for indoor
localization have failed to deliver acceptable accuracy due to fundamental
limitations in measuring time on Wi-Fi and other RF consumer technologies.
While the research community has developed alternatives for RF-based indoor
localization that do not require time-of-flight, those approaches have their
own limitations that hamper their use in practice. In particular, many existing
approaches need receivers with large antenna arrays while commercial Wi-Fi
nodes have two or three antennas. Other systems require fingerprinting the
environment to create signal maps. More fundamentally, none of these methods
support indoor positioning between a pair of Wi-Fi devices
without~third~party~support.
In this paper, we present a set of algorithms that measure the time-of-flight
to sub-nanosecond accuracy on commercial Wi-Fi cards. We implement these
algorithms and demonstrate a system that achieves accurate device-to-device
localization, i.e. enables a pair of Wi-Fi devices to locate each other without
any support from the infrastructure, not even the location of the access
points.Comment: 14 page
Application of the Evidence Procedure to the Estimation of Wireless Channels
We address the application of the Bayesian evidence procedure to the estimation of wireless channels. The proposed scheme is based on relevance vector machines (RVM) originally proposed by M. Tipping. RVMs allow to estimate channel parameters as well as to assess the number of multipath components constituting the channel within the Bayesian framework by locally maximizing the evidence integral. We show that, in the case of channel sounding using pulse-compression techniques, it is possible to cast the channel model as a general linear model, thus allowing RVM methods to be applied. We extend the original RVM algorithm to the multiple-observation/multiple-sensor scenario by proposing a new graphical model to represent multipath components. Through the analysis of the evidence procedure we develop a thresholding algorithm that is used in estimating the number of components. We also discuss the relationship of the evidence procedure to the standard minimum description length (MDL) criterion. We show that the maximum of the evidence corresponds to the minimum of the MDL criterion. The applicability of the proposed scheme is demonstrated with synthetic as well as real-world channel measurements, and a performance increase over the conventional MDL criterion applied to maximum-likelihood estimates of the channel parameters is observed
Machine Learning Tools for Radio Map Estimation in Fading-Impaired Channels
In spectrum cartography, also known as radio map estimation, one constructs maps that provide the value of a given channel metric such as as the received power, power spectral density (PSD), electromagnetic absorption, or channel-gain for every spatial location in the geographic area of interest. The main idea is to deploy sensors and measure the target channel metric at a set of locations and interpolate or extrapolate the measurements. Radio maps nd a myriad of applications in wireless communications such as network planning, interference coordination, power control, spectrum management, resource allocation, handoff optimization, dynamic spectrum access, and cognitive radio. More recently, radio maps have been widely recognized as an enabling technology for unmanned aerial vehicle (UAV) communications because they allow autonomous UAVs to account for communication constraints when planning a mission. Additional use cases include radio tomography and source localization.publishedVersio
Sparse Volterra and Polynomial Regression Models: Recoverability and Estimation
Volterra and polynomial regression models play a major role in nonlinear
system identification and inference tasks. Exciting applications ranging from
neuroscience to genome-wide association analysis build on these models with the
additional requirement of parsimony. This requirement has high interpretative
value, but unfortunately cannot be met by least-squares based or kernel
regression methods. To this end, compressed sampling (CS) approaches, already
successful in linear regression settings, can offer a viable alternative. The
viability of CS for sparse Volterra and polynomial models is the core theme of
this work. A common sparse regression task is initially posed for the two
models. Building on (weighted) Lasso-based schemes, an adaptive RLS-type
algorithm is developed for sparse polynomial regressions. The identifiability
of polynomial models is critically challenged by dimensionality. However,
following the CS principle, when these models are sparse, they could be
recovered by far fewer measurements. To quantify the sufficient number of
measurements for a given level of sparsity, restricted isometry properties
(RIP) are investigated in commonly met polynomial regression settings,
generalizing known results for their linear counterparts. The merits of the
novel (weighted) adaptive CS algorithms to sparse polynomial modeling are
verified through synthetic as well as real data tests for genotype-phenotype
analysis.Comment: 20 pages, to appear in IEEE Trans. on Signal Processin
- …