5,363 research outputs found
Sequential estimation of the range and the bearing using the zero-forcing MUSIC approach
International audienceIn this paper, we consider the range and bearing estimation of near-field narrow-band sources from noisy data observed across a passive sensor array. For some difficult scenarios as for correlated and largely spaced sources at low SNRs, or correlated and closely spaced sources, the Near FieLd (NFL) version of the MUltiple SIgnal Classification (MUSIC) algorithm is no longer reliable. In this paper, we adapt and extend the sequential Zero-Forcing MUSIC (ZF-MUSIC) algorithm, which avoids the delicate search of multiple maxima, to the NFL context. In order to compare the NFL ZF-MUSIC with the Second-Order Statistics Weighted Prediction (SOS-WP) algorithm, we assumed an uniform sampling in the spatial domain. However, the proposed algorithm can be exploited for general array geometries. Finally numerical simulations show that the variance of the proposed algorithm achieves the Cram'er-Rao Bound (CRB) in difficult scenarios and for sufficient Signal to Noise Ratio (SNR)
Dynamic filtering of static dipoles in magnetoencephalography
We consider the problem of estimating neural activity from measurements
of the magnetic fields recorded by magnetoencephalography. We exploit
the temporal structure of the problem and model the neural current as a
collection of evolving current dipoles, which appear and disappear, but whose
locations are constant throughout their lifetime. This fully reflects the physiological
interpretation of the model.
In order to conduct inference under this proposed model, it was necessary
to develop an algorithm based around state-of-the-art sequential Monte
Carlo methods employing carefully designed importance distributions. Previous
work employed a bootstrap filter and an artificial dynamic structure
where dipoles performed a random walk in space, yielding nonphysical artefacts
in the reconstructions; such artefacts are not observed when using the
proposed model. The algorithm is validated with simulated data, in which
it provided an average localisation error which is approximately half that of
the bootstrap filter. An application to complex real data derived from a somatosensory
experiment is presented. Assessment of model fit via marginal
likelihood showed a clear preference for the proposed model and the associated
reconstructions show better localisation
Hybrid Beamforming via the Kronecker Decomposition for the Millimeter-Wave Massive MIMO Systems
Despite its promising performance gain, the realization of mmWave massive
MIMO still faces several practical challenges. In particular, implementing
massive MIMO in the digital domain requires hundreds of RF chains matching the
number of antennas. Furthermore, designing these components to operate at the
mmWave frequencies is challenging and costly. These motivated the recent
development of hybrid-beamforming where MIMO processing is divided for separate
implementation in the analog and digital domains, called the analog and digital
beamforming, respectively. Analog beamforming using a phase array introduces
uni-modulus constraints on the beamforming coefficients, rendering the
conventional MIMO techniques unsuitable and call for new designs. In this
paper, we present a systematic design framework for hybrid beamforming for
multi-cell multiuser massive MIMO systems over mmWave channels characterized by
sparse propagation paths. The framework relies on the decomposition of analog
beamforming vectors and path observation vectors into Kronecker products of
factors being uni-modulus vectors. Exploiting properties of Kronecker mixed
products, different factors of the analog beamformer are designed for either
nulling interference paths or coherently combining data paths. Furthermore, a
channel estimation scheme is designed for enabling the proposed hybrid
beamforming. The scheme estimates the AoA of data and interference paths by
analog beam scanning and data-path gains by analog beam steering. The
performance of the channel estimation scheme is analyzed. In particular, the
AoA spectrum resulting from beam scanning, which displays the magnitude
distribution of paths over the AoA range, is derived in closed-form. It is
shown that the inter-cell interference level diminishes inversely with the
array size, the square root of pilot sequence length and the spatial separation
between paths.Comment: Submitted to IEEE JSAC Special Issue on Millimeter Wave
Communications for Future Mobile Networks, minor revisio
Joint ML calibration and DOA estimation with separated arrays
This paper investigates parametric direction-of-arrival (DOA) estimation in a
particular context: i) each sensor is characterized by an unknown complex gain
and ii) the array consists of a collection of subarrays which are substantially
separated from each other leading to a structured noise covariance matrix. We
propose two iterative algorithms based on the maximum likelihood (ML)
estimation method adapted to the context of joint array calibration and DOA
estimation. Numerical simulations reveal that the two proposed schemes, the
iterative ML (IML) and the modified iterative ML (MIML) algorithms for joint
array calibration and DOA estimation, outperform the state of the art methods
and the MIML algorithm reaches the Cram\'er-Rao bound for a low number of
iterations
Multiple and single snapshot compressive beamforming
For a sound field observed on a sensor array, compressive sensing (CS)
reconstructs the direction-of-arrival (DOA) of multiple sources using a
sparsity constraint. The DOA estimation is posed as an underdetermined problem
by expressing the acoustic pressure at each sensor as a phase-lagged
superposition of source amplitudes at all hypothetical DOAs. Regularizing with
an -norm constraint renders the problem solvable with convex
optimization, and promoting sparsity gives high-resolution DOA maps. Here, the
sparse source distribution is derived using maximum a posteriori (MAP)
estimates for both single and multiple snapshots. CS does not require inversion
of the data covariance matrix and thus works well even for a single snapshot
where it gives higher resolution than conventional beamforming. For multiple
snapshots, CS outperforms conventional high-resolution methods, even with
coherent arrivals and at low signal-to-noise ratio. The superior resolution of
CS is demonstrated with vertical array data from the SWellEx96 experiment for
coherent multi-paths.Comment: In press Journal of Acoustical Society of Americ
Exploring the Evolution of Node Neighborhoods in Dynamic Networks
Dynamic Networks are a popular way of modeling and studying the behavior of
evolving systems. However, their analysis constitutes a relatively recent
subfield of Network Science, and the number of available tools is consequently
much smaller than for static networks. In this work, we propose a method
specifically designed to take advantage of the longitudinal nature of dynamic
networks. It characterizes each individual node by studying the evolution of
its direct neighborhood, based on the assumption that the way this neighborhood
changes reflects the role and position of the node in the whole network. For
this purpose, we define the concept of \textit{neighborhood event}, which
corresponds to the various transformations such groups of nodes can undergo,
and describe an algorithm for detecting such events. We demonstrate the
interest of our method on three real-world networks: DBLP, LastFM and Enron. We
apply frequent pattern mining to extract meaningful information from temporal
sequences of neighborhood events. This results in the identification of
behavioral trends emerging in the whole network, as well as the individual
characterization of specific nodes. We also perform a cluster analysis, which
reveals that, in all three networks, one can distinguish two types of nodes
exhibiting different behaviors: a very small group of active nodes, whose
neighborhood undergo diverse and frequent events, and a very large group of
stable nodes
- âŠ