Computationally efficient sparsity-inducing coherence spectrum estimation of complete and non-complete data sets

  • Authors:

  • K. Angelopoulos;G. O. Glentis;A. Jakobsson

  • Affiliations:

  • Department of Science and Technology of Telecommunications, University of Peloponnese, Tripolis 22100, Greece;Department of Science and Technology of Telecommunications, University of Peloponnese, Tripolis 22100, Greece;Department of Mathematical Statistics, Lund University, P.O. Box 118, SE-221 00 Lund, Sweden

  • Venue:
  • Signal Processing
  • Year:
  • 2013

Quantified Score

Hi-index 0.08

Visualization

Abstract

The magnitude squared coherence (MSC) spectrum is an often used frequency-dependent measure for the linear dependency between two stationary processes, and the recent literature contain several contributions on how to form high-resolution data-dependent and adaptive MSC estimators, and on the efficient implementation of such estimators. In this work, we further this development with the presentation of computationally efficient implementations of the recent iterative adaptive approach (IAA) estimator, present a novel sparse learning via iterative minimization (SLIM) algorithm, discuss extensions to two-dimensional data sets, examining both the case of complete data sets and when some of the observations are missing. The algorithms further the recent development of exploiting the estimators' inherently low displacement rank of the necessary products of Toeplitz-like matrices, extending these formulations to the coherence estimation using IAA and SLIM formulations. The performance of the proposed algorithms and implementations are illustrated both with theoretical complexity measures and with numerical simulations.