Efficient Covariance Matrix Reconstruction with Iterative Spatial
Spectrum Sampling
- URL: http://arxiv.org/abs/2309.01040v1
- Date: Sat, 2 Sep 2023 23:58:01 GMT
- Title: Efficient Covariance Matrix Reconstruction with Iterative Spatial
Spectrum Sampling
- Authors: S. Mohammadzadeh, V. H. Nascimento, R. C. de Lamare and O. Kukrer
- Abstract summary: We propose a cost-effective technique for designing robust adaptive beamforming algorithms with iterative spatial power spectrum (CMR-ISPS)
The proposed CMR-ISPS approach reconstructs the interference-plus-noise covariance matrix based on a simplified maximum entropy power spectral density function.
The proposed CMR-ISPS beamformer can suppress interferers close to the direction of the signal of interest by producing notches in the directional response of the array with sufficient depths.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This work presents a cost-effective technique for designing robust adaptive
beamforming algorithms based on efficient covariance matrix reconstruction with
iterative spatial power spectrum (CMR-ISPS). The proposed CMR-ISPS approach
reconstructs the interference-plus-noise covariance (INC) matrix based on a
simplified maximum entropy power spectral density function that can be used to
shape the directional response of the beamformer. Firstly, we estimate the
directions of arrival (DoAs) of the interfering sources with the available
snapshots. We then develop an algorithm to reconstruct the INC matrix using a
weighted sum of outer products of steering vectors whose coefficients can be
estimated in the vicinity of the DoAs of the interferences which lie in a small
angular sector. We also devise a cost-effective adaptive algorithm based on
conjugate gradient techniques to update the beamforming weights and a method to
obtain estimates of the signal of interest (SOI) steering vector from the
spatial power spectrum. The proposed CMR-ISPS beamformer can suppress
interferers close to the direction of the SOI by producing notches in the
directional response of the array with sufficient depths. Simulation results
are provided to confirm the validity of the proposed method and make a
comparison to existing approaches
Related papers
- Variance-Reducing Couplings for Random Features: Perspectives from Optimal Transport [57.73648780299374]
Random features (RFs) are a popular technique to scale up kernel methods in machine learning, replacing exact kernel evaluations with Monte Carlo estimates.
We tackle this through the unifying framework of optimal transport, using theoretical insights and numerical algorithms to develop novel, high-performing RF couplings for kernels defined on Euclidean and discrete input spaces.
We reach surprising conclusions about the benefits and limitations of variance reduction as a paradigm.
arXiv Detail & Related papers (2024-05-26T12:25:09Z) - Distributed Markov Chain Monte Carlo Sampling based on the Alternating
Direction Method of Multipliers [143.6249073384419]
In this paper, we propose a distributed sampling scheme based on the alternating direction method of multipliers.
We provide both theoretical guarantees of our algorithm's convergence and experimental evidence of its superiority to the state-of-the-art.
In simulation, we deploy our algorithm on linear and logistic regression tasks and illustrate its fast convergence compared to existing gradient-based methods.
arXiv Detail & Related papers (2024-01-29T02:08:40Z) - Study of Robust Adaptive Beamforming with Covariance Matrix
Reconstruction Based on Power Spectral Estimation and Uncertainty Region [0.0]
A robust adaptive beamforming technique is proposed for uniform linear arrays.
Two algorithms are presented to find the angular sector of interference in every snapshot.
A power spectrum is introduced based on the estimation of the power of interference and noise components.
arXiv Detail & Related papers (2023-03-18T23:09:40Z) - Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem.
We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
arXiv Detail & Related papers (2023-02-13T19:57:17Z) - Study of Robust Adaptive Beamforming Based on Low-Complexity DFT Spatial
Sampling [26.82194157337935]
A novel and robust algorithm is proposed for adaptive beamforming based on the idea of reconstructing the autocorrelation sequence.
A key advantage of the proposed adaptive beamforming is that only little prior information is required.
arXiv Detail & Related papers (2021-06-23T21:46:54Z) - Adaptive filters for the moving target indicator system [10.152838128195468]
Two approaches to improve the convergence of adaptive algorithms are presented.
The proposed approach is based on an empirical signal to interference plus noise ratio (SINR)
Its effectiveness is demonstrated using simulated data.
arXiv Detail & Related papers (2020-12-31T04:22:55Z) - Low-Cost Maximum Entropy Covariance Matrix Reconstruction Algorithm for
Robust Adaptive Beamforming [0.0]
We present a novel low-complexity adaptive beamforming technique using a gradient algorithm to avoid matrix inversions.
The proposed method exploits algorithms based on the maximum entropy power spectrum (MEPS) to estimate the noise-plus-interference covariance matrix (MEPS-NPIC)
arXiv Detail & Related papers (2020-12-28T16:26:55Z) - Optimization of loading factor preventing target cancellation [11.193504036335503]
The paper presents an iterative algorithm for loading factor optimization based on sample of empirical signal to interference plus noise ratio (SINR)
The proposed solution does not rely on any assumptions regarding the structure empirical covariance matrix and signal penetration model.
arXiv Detail & Related papers (2020-10-09T14:04:48Z) - Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices.
We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT)
Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
arXiv Detail & Related papers (2020-10-01T18:14:11Z) - A Dynamical Systems Approach for Convergence of the Bayesian EM
Algorithm [59.99439951055238]
We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based.
The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM)
We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
arXiv Detail & Related papers (2020-06-23T01:34:18Z) - Optimization-driven Deep Reinforcement Learning for Robust Beamforming
in IRS-assisted Wireless Communications [54.610318402371185]
Intelligent reflecting surface (IRS) is a promising technology to assist downlink information transmissions from a multi-antenna access point (AP) to a receiver.
We minimize the AP's transmit power by a joint optimization of the AP's active beamforming and the IRS's passive beamforming.
We propose a deep reinforcement learning (DRL) approach that can adapt the beamforming strategies from past experiences.
arXiv Detail & Related papers (2020-05-25T01:42:55Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.