3,024 research outputs found
Recommended from our members
A sub-Nyquist co-prime sampling music spectral approach for natural frequency identification of white-noise excited structures
Motivated by practical needs to reduce data transmission payloads in wireless sensors for vibration-based monitoring of civil engineering structures, this paper proposes a novel approach for identifying resonant frequencies of white-noise excited structures using acceleration measurements acquired at rates significantly below the Nyquist rate. The approach adopts the deterministic co-prime sub-Nyquist sampling scheme, originally developed to facilitate telecommunication applications, to estimate the autocorrelation function of response acceleration time-histories of low-amplitude white-noise excited structures treated as realizations of a stationary stochastic process. This is achieved without posing any sparsity conditions to the signals. Next, the standard MUSIC algorithm is applied to the estimated autocorrelation function to derive a denoised super-resolution pseudo-spectrum in which natural frequencies are marked by prominent spikes. The accuracy and applicability of the proposed approach is numerically assessed using computer-generated noise-corrupted acceleration time-history data obtained by a simulation-based framework pertaining to a white-noise excited structural system with two closely-spaced modes of vibration carrying the same amount of energy, and a third isolated weakly excited vibrating mode. All three natural frequencies are accurately identified by sampling at as low as 78% below Nyquist rate for signal to noise ratio as low as 0dB (i.e., energy of additive white noise equal to the signal energy), suggesting that the proposed approach is robust and noise-immune while it can reduce data transmission requirements in acceleration wireless sensors for natural frequency identification of engineering structures
A globally convergent matricial algorithm for multivariate spectral estimation
In this paper, we first describe a matricial Newton-type algorithm designed
to solve the multivariable spectrum approximation problem. We then prove its
global convergence. Finally, we apply this approximation procedure to
multivariate spectral estimation, and test its effectiveness through
simulation. Simulation shows that, in the case of short observation records,
this method may provide a valid alternative to standard multivariable
identification techniques such as MATLAB's PEM and MATLAB's N4SID
A new family of high-resolution multivariate spectral estimators
In this paper, we extend the Beta divergence family to multivariate power
spectral densities. Similarly to the scalar case, we show that it smoothly
connects the multivariate Kullback-Leibler divergence with the multivariate
Itakura-Saito distance. We successively study a spectrum approximation problem,
based on the Beta divergence family, which is related to a multivariate
extension of the THREE spectral estimation technique. It is then possible to
characterize a family of solutions to the problem. An upper bound on the
complexity of these solutions will also be provided. Simulations suggest that
the most suitable solution of this family depends on the specific features
required from the estimation problem
Forecasting Time Series with VARMA Recursions on Graphs
Graph-based techniques emerged as a choice to deal with the dimensionality
issues in modeling multivariate time series. However, there is yet no complete
understanding of how the underlying structure could be exploited to ease this
task. This work provides contributions in this direction by considering the
forecasting of a process evolving over a graph. We make use of the
(approximate) time-vertex stationarity assumption, i.e., timevarying graph
signals whose first and second order statistical moments are invariant over
time and correlated to a known graph topology. The latter is combined with VAR
and VARMA models to tackle the dimensionality issues present in predicting the
temporal evolution of multivariate time series. We find out that by projecting
the data to the graph spectral domain: (i) the multivariate model estimation
reduces to that of fitting a number of uncorrelated univariate ARMA models and
(ii) an optimal low-rank data representation can be exploited so as to further
reduce the estimation costs. In the case that the multivariate process can be
observed at a subset of nodes, the proposed models extend naturally to Kalman
filtering on graphs allowing for optimal tracking. Numerical experiments with
both synthetic and real data validate the proposed approach and highlight its
benefits over state-of-the-art alternatives.Comment: submitted to the IEEE Transactions on Signal Processin
On the existence of a solution to a spectral estimation problem \emph{\`a la} Byrnes-Georgiou-Lindquist
A parametric spectral estimation problem in the style of Byrnes, Georgiou,
and Lindquist was posed in \cite{FPZ-10}, but the existence of a solution was
only proved in a special case. Based on their results, we show that a solution
indeed exists given an arbitrary matrix-valued prior density. The main tool in
our proof is the topological degree theory.Comment: 6 pages of two-column draft, accepted for publication in IEEE-TA
Statistical Inference in Large Antenna Arrays under Unknown Noise Pattern
In this article, a general information-plus-noise transmission model is
assumed, the receiver end of which is composed of a large number of sensors and
is unaware of the noise pattern. For this model, and under reasonable
assumptions, a set of results is provided for the receiver to perform
statistical eigen-inference on the information part. In particular, we
introduce new methods for the detection, counting, and the power and subspace
estimation of multiple sources composing the information part of the
transmission. The theoretical performance of some of these techniques is also
discussed. An exemplary application of these methods to array processing is
then studied in greater detail, leading in particular to a novel MUSIC-like
algorithm assuming unknown noise covariance.Comment: 25 pages, 5 figure
Time and spectral domain relative entropy: A new approach to multivariate spectral estimation
The concept of spectral relative entropy rate is introduced for jointly
stationary Gaussian processes. Using classical information-theoretic results,
we establish a remarkable connection between time and spectral domain relative
entropy rates. This naturally leads to a new spectral estimation technique
where a multivariate version of the Itakura-Saito distance is employed}. It may
be viewed as an extension of the approach, called THREE, introduced by Byrnes,
Georgiou and Lindquist in 2000 which, in turn, followed in the footsteps of the
Burg-Jaynes Maximum Entropy Method. Spectral estimation is here recast in the
form of a constrained spectrum approximation problem where the distance is
equal to the processes relative entropy rate. The corresponding solution
entails a complexity upper bound which improves on the one so far available in
the multichannel framework. Indeed, it is equal to the one featured by THREE in
the scalar case. The solution is computed via a globally convergent matricial
Newton-type algorithm. Simulations suggest the effectiveness of the new
technique in tackling multivariate spectral estimation tasks, especially in the
case of short data records.Comment: 32 pages, submitted for publicatio
- …