3,131 research outputs found
Low Complexity Blind Equalization for OFDM Systems with General Constellations
This paper proposes a low-complexity algorithm for blind equalization of data
in OFDM-based wireless systems with general constellations. The proposed
algorithm is able to recover data even when the channel changes on a
symbol-by-symbol basis, making it suitable for fast fading channels. The
proposed algorithm does not require any statistical information of the channel
and thus does not suffer from latency normally associated with blind methods.
We also demonstrate how to reduce the complexity of the algorithm, which
becomes especially low at high SNR. Specifically, we show that in the high SNR
regime, the number of operations is of the order O(LN), where L is the cyclic
prefix length and N is the total number of subcarriers. Simulation results
confirm the favorable performance of our algorithm
Symmetric tensor decomposition
We present an algorithm for decomposing a symmetric tensor, of dimension n
and order d as a sum of rank-1 symmetric tensors, extending the algorithm of
Sylvester devised in 1886 for binary forms. We recall the correspondence
between the decomposition of a homogeneous polynomial in n variables of total
degree d as a sum of powers of linear forms (Waring's problem), incidence
properties on secant varieties of the Veronese Variety and the representation
of linear forms as a linear combination of evaluations at distinct points. Then
we reformulate Sylvester's approach from the dual point of view. Exploiting
this duality, we propose necessary and sufficient conditions for the existence
of such a decomposition of a given rank, using the properties of Hankel (and
quasi-Hankel) matrices, derived from multivariate polynomials and normal form
computations. This leads to the resolution of polynomial equations of small
degree in non-generic cases. We propose a new algorithm for symmetric tensor
decomposition, based on this characterization and on linear algebra
computations with these Hankel matrices. The impact of this contribution is
two-fold. First it permits an efficient computation of the decomposition of any
tensor of sub-generic rank, as opposed to widely used iterative algorithms with
unproved global convergence (e.g. Alternate Least Squares or gradient
descents). Second, it gives tools for understanding uniqueness conditions, and
for detecting the rank
Symmetric Tensor Decomposition by an Iterative Eigendecomposition Algorithm
We present an iterative algorithm, called the symmetric tensor eigen-rank-one
iterative decomposition (STEROID), for decomposing a symmetric tensor into a
real linear combination of symmetric rank-1 unit-norm outer factors using only
eigendecompositions and least-squares fitting. Originally designed for a
symmetric tensor with an order being a power of two, STEROID is shown to be
applicable to any order through an innovative tensor embedding technique.
Numerical examples demonstrate the high efficiency and accuracy of the proposed
scheme even for large scale problems. Furthermore, we show how STEROID readily
solves a problem in nonlinear block-structured system identification and
nonlinear state-space identification
Spectral partitioning of time-varying networks with unobserved edges
We discuss a variant of `blind' community detection, in which we aim to
partition an unobserved network from the observation of a (dynamical) graph
signal defined on the network. We consider a scenario where our observed graph
signals are obtained by filtering white noise input, and the underlying network
is different for every observation. In this fashion, the filtered graph signals
can be interpreted as defined on a time-varying network. We model each of the
underlying network realizations as generated by an independent draw from a
latent stochastic blockmodel (SBM). To infer the partition of the latent SBM,
we propose a simple spectral algorithm for which we provide a theoretical
analysis and establish consistency guarantees for the recovery. We illustrate
our results using numerical experiments on synthetic and real data,
highlighting the efficacy of our approach.Comment: 5 pages, 2 figure
Robust equalization of multichannel acoustic systems
In most real-world acoustical scenarios, speech signals captured by distant microphones from a source are reverberated due to multipath propagation, and the reverberation may impair speech intelligibility. Speech dereverberation can be achieved
by equalizing the channels from the source to microphones. Equalization systems can
be computed using estimates of multichannel acoustic impulse responses. However,
the estimates obtained from system identification always include errors; the fact that
an equalization system is able to equalize the estimated multichannel acoustic system does not mean that it is able to equalize the true system. The objective of this
thesis is to propose and investigate robust equalization methods for multichannel
acoustic systems in the presence of system identification errors.
Equalization systems can be computed using the multiple-input/output inverse theorem or multichannel least-squares method. However, equalization systems
obtained from these methods are very sensitive to system identification errors. A
study of the multichannel least-squares method with respect to two classes of characteristic channel zeros is conducted. Accordingly, a relaxed multichannel least-
squares method is proposed. Channel shortening in connection with the multiple-
input/output inverse theorem and the relaxed multichannel least-squares method is
discussed.
Two algorithms taking into account the system identification errors are developed. Firstly, an optimally-stopped weighted conjugate gradient algorithm is
proposed. A conjugate gradient iterative method is employed to compute the equalization system. The iteration process is stopped optimally with respect to system identification errors. Secondly, a system-identification-error-robust equalization
method exploring the use of error models is presented, which incorporates system
identification error models in the weighted multichannel least-squares formulation
Widely Linear vs. Conventional Subspace-Based Estimation of SIMO Flat-Fading Channels: Mean-Squared Error Analysis
We analyze the mean-squared error (MSE) performance of widely linear (WL) and
conventional subspace-based channel estimation for single-input multiple-output
(SIMO) flat-fading channels employing binary phase-shift-keying (BPSK)
modulation when the covariance matrix is estimated using a finite number of
samples. The conventional estimator suffers from a phase ambiguity that reduces
to a sign ambiguity for the WL estimator. We derive closed-form expressions for
the MSE of the two estimators under four different ambiguity resolution
scenarios. The first scenario is optimal resolution, which minimizes the
Euclidean distance between the channel estimate and the actual channel. The
second scenario assumes that a randomly chosen coefficient of the actual
channel is known and the third assumes that the one with the largest magnitude
is known. The fourth scenario is the more realistic case where pilot symbols
are used to resolve the ambiguities. Our work demonstrates that there is a
strong relationship between the accuracy of ambiguity resolution and the
relative performance of WL and conventional subspace-based estimators, and
shows that the less information available about the actual channel for
ambiguity resolution, or the lower the accuracy of this information, the higher
the performance gap in favor of the WL estimator.Comment: 20 pages, 7 figure
Tensor decompositions for learning latent variable models
This work considers a computationally and statistically efficient parameter
estimation method for a wide class of latent variable models---including
Gaussian mixture models, hidden Markov models, and latent Dirichlet
allocation---which exploits a certain tensor structure in their low-order
observable moments (typically, of second- and third-order). Specifically,
parameter estimation is reduced to the problem of extracting a certain
(orthogonal) decomposition of a symmetric tensor derived from the moments; this
decomposition can be viewed as a natural generalization of the singular value
decomposition for matrices. Although tensor decompositions are generally
intractable to compute, the decomposition of these specially structured tensors
can be efficiently obtained by a variety of approaches, including power
iterations and maximization approaches (similar to the case of matrices). A
detailed analysis of a robust tensor power method is provided, establishing an
analogue of Wedin's perturbation theorem for the singular vectors of matrices.
This implies a robust and computationally tractable estimation approach for
several popular latent variable models
- …