Invariant Two-Parameter Family of Circulant Sparse Matrices and Its Application in Correlation Signal Theory

A new algebraic approach to approximation of correlation matrices of discrete signals based on a special family of square matrices with sparse circulant alternation of elements is developed. It is shown that the matrices of this family form a linear subspace that is invariant to a certain two-parameter system of shifts. An orthogonal matrix basis of this subspace is found and analytical expressions for the eigenvectors and eigenvalues of the matrices included in it are obtained. It is shown that the correlation matrices of discrete signals are well approximated by matrices from such an invariant family, and expressions are obtained for their optimal approximation by the criterion of minimum mean square error. It is shown that the obtained results make it possible to significantly simplify the computational implementation of algorithms for optimal correlation signal processing in practice without significant losses in their optimality.

Authors

Institutions

Publication Details

Published
2025-06-30
DOI
https://doi.org/10.1109/synchroinfo65403.2025.11079362
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Invariant Two-Parameter Family of Circulant Sparse Matrices and Its Application in Correlation Signal Theory

V. G. Sannikov, V. P. Volchkov
Matrix Theory and Algorithms
article

Invariant Two-Parameter Family of Circulant Sparse Matrices and Its Application in Correlation Signal Theory

V. G. Sannikov, V. P. Volchkov
article en

Abstract

A new algebraic approach to approximation of correlation matrices of discrete signals based on a special family of square matrices with sparse circulant alternation of elements is developed. It is shown that the matrices of this family form a linear subspace that is invariant to a certain two-parameter system of shifts. An orthogonal matrix basis of this subspace is found and analytical expressions for the eigenvectors and eigenvalues of the matrices included in it are obtained. It is shown that the correlation matrices of discrete signals are well approximated by matrices from such an invariant family, and expressions are obtained for their optimal approximation by the criterion of minimum mean square error. It is shown that the obtained results make it possible to significantly simplify the computational implementation of algorithms for optimal correlation signal processing in practice without significant losses in their optimality.

Moscow Technical University of Communication and Informatics (RU)
Openalex Percentile: Top 81%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.