Introduces the Universal Switching Beamformer that maintains an exponentially large set of covariance histories via a linear transition diagram and re-weights them by cumulative output power, with a proven regret bound to an oracle.
Time Segmented Beamforming via Dynamic Programming: Theory and Implementation
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In dynamic acoustic environments with time-varying interferers, effective beamforming requires identifying stationary regions over time. The Capon beamformer, a whitened matched filter constrained to maintain unity gain in the desired direction, theoretically relies on the instantaneous ensemble covariance matrix. Practical implementations rely on the batch Capon (or Sample Matrix Inversion), which estimates the sample covariance matrix (SCM) by averaging over a block of snapshots. This practical approach implicitly assumes that the data within the batch window is stationary and can be coherently combined. In non-stationary settings, a batch approach that averages over fixed or excessively long windows fails, as moving interferers smear the SCM and degrade the beamformer's nulling capabilities. To address this, this paper introduces a temporally segmented distortionless response beamformer. Inspired by the segmented least squares method, which fits piecewise polynomials to data while penalizing excessive segmentation to prevent overfitting, the framework extends practical Capon beamforming by incorporating data-driven temporal segmentation. This formulation minimizes output power while dynamically adapting the SCM estimation windows to local stationarity, offering a principled approach to tracking time-varying interferers.
fields
eess.SP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Switching Beamformer for Highly Non-Stationary Environments
Introduces the Universal Switching Beamformer that maintains an exponentially large set of covariance histories via a linear transition diagram and re-weights them by cumulative output power, with a proven regret bound to an oracle.