pith. sign in

arxiv: 2312.03922 · v1 · pith:MGSIVCTAnew · submitted 2023-12-06 · 📡 eess.SP

Slepian Beamforming: Broadband Beamforming using Streaming Least Squares

classification 📡 eess.SP
keywords modelbeamformingbroadbandsignalmethodsamplesblocksdelay
0
0 comments X
read the original abstract

In this paper we revisit the classical problem of estimating a signal as it impinges on a multi-sensor array. We focus on the case where the impinging signal's bandwidth is appreciable and is operating in a broadband regime. Estimating broadband signals, often termed broadband (or wideband) beamforming, is traditionally done through filter and summation, true time delay, or a coupling of the two. Our proposed method deviates substantially from these paradigms in that it requires no notion of filtering or true time delay. We use blocks of samples taken directly from the sensor outputs to fit a robust Slepian subspace model using a least squares approach. We then leverage this model to estimate uniformly spaced samples of the impinging signal. Alongside a careful discussion of this model and how to choose its parameters we show how to fit the model to new blocks of samples as they are received, producing a streaming output. We then go on to show how this method naturally extends to adaptive beamforming scenarios, where we leverage signal statistics to attenuate interfering sources. Finally, we discuss how to use our model to estimate from dimensionality reducing measurements. Accompanying these discussions are extensive numerical experiments establishing that our method outperforms existing filter based approaches while being comparable in terms of computational complexity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Fast Broadband Beamspace Transformation

    eess.SP 2025-12 conditional novelty 7.0

    A new algorithm computes multiple broadband beams from array sensors with near-linear scaling in array size by encoding samples with a non-uniform Fourier transform and solving small structured systems per beam.