Scalable approach for analytic polynomial subspace projection matrices for a space-time covariance matrix

Tools

Khattak, Faizan A. and Bakhit, Mohammed and Proudler, Ian K. and Weiss, Stephan (2024) Scalable approach for analytic polynomial subspace projection matrices for a space-time covariance matrix. In: IEEE High Performance Extreme Computing Conference, 2024-09-23 - 2024-09-27.

[thumbnail of Khattak-etal-IEEE-HPECC-2024-Scalable-approach-for-analytic-polynomial-subspace]
Preview
 Text. Filename: Khattak-etal-IEEE-HPECC-2024-Scalable-approach-for-analytic-polynomial-subspace.pdf
Accepted Author Manuscript
License: Creative Commons Attribution 4.0 logo
Download (527kB)| Preview

Abstract

In sensor array applications, it can be advantageous to project data onto a given signal subspace, for example, to improve the SNR or as part of direction finding algorithms. In the broadband case, a projection operator can be derived via polynomial matrices and, more specifically, from a space- time covariance matrix. Traditional methods perform a complete polynomial eigenvalue decomposition (PEVD) to achieve this, which can be computationally intensive. We propose a novel method to compute these subspace matrices directly, without the need for a full PEVD. Our approach is evaluated against existing methods using an ensemble of randomized para-Hermitian matrices, demonstrating significant improvements in both accuracy and computation time.

ORCID iDs

Khattak, Faizan A., Bakhit, Mohammed, Proudler, Ian K. and Weiss, Stephan ORCID logoORCID: https://orcid.org/0000-0002-3486-7206;
CORE (COnnecting REpositories)