Low-Cost Maximum Entropy Covariance Matrix Reconstruction Algorithm for
Robust Adaptive Beamforming
- URL: http://arxiv.org/abs/2012.14338v1
- Date: Mon, 28 Dec 2020 16:26:55 GMT
- Title: Low-Cost Maximum Entropy Covariance Matrix Reconstruction Algorithm for
Robust Adaptive Beamforming
- Authors: S. Mohammadzadeh, V. H. Nascimento, R. C. de Lamare
- Abstract summary: 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)
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this letter, we present a novel low-complexity adaptive beamforming
technique using a stochastic 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) so
that the beamforming weights are updated adaptively, thus greatly reducing the
computational complexity. MEPS is further used to reconstruct the desired
signal covariance matrix and to improve the estimate of the desired signals's
steering vector (SV). Simulations show the superiority of the proposed
MEPS-NPIC approach over previously proposed beamformers.
Related papers
- Federated Conditional Stochastic Optimization [110.513884892319]
Conditional optimization has found in a wide range of machine learning tasks, such as in-variant learning tasks, AUPRC, andAML.
This paper proposes algorithms for distributed federated learning.
arXiv Detail & Related papers (2023-10-04T01:47:37Z) - Efficient Covariance Matrix Reconstruction with Iterative Spatial
Spectrum Sampling [0.0]
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.
arXiv Detail & Related papers (2023-09-02T23:58:01Z) - 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) - Adaptive Zeroth-Order Optimisation of Nonconvex Composite Objectives [1.7640556247739623]
We analyze algorithms for zeroth-order entropy composite objectives, focusing on dependence on dimensionality.
This is achieved by exploiting low dimensional structure of the decision set using the mirror descent method with an estimation alike function.
To improve the gradient, we replace the classic sampling method based on Rademacher and show that the mini-batch method copes with non-Eucli geometry.
arXiv Detail & Related papers (2022-08-09T07:36:25Z) - Estimation in Rotationally Invariant Generalized Linear Models via
Approximate Message Passing [21.871513580418604]
We propose a novel family of approximate message passing (AMP) algorithms for signal estimation.
We rigorously characterize their performance in the high-dimensional limit via a state evolution recursion.
arXiv Detail & Related papers (2021-12-08T15:20:04Z) - Fast Scalable Image Restoration using Total Variation Priors and
Expectation Propagation [7.7731951589289565]
This paper presents a scalable approximate Bayesian method for image restoration using total variation (TV) priors.
We use the expectation propagation (EP) framework to approximate minimum mean squared error (MMSE) estimators and marginal (pixel-wise) variances.
arXiv Detail & Related papers (2021-10-04T17:28:41Z) - Momentum Accelerates the Convergence of Stochastic AUPRC Maximization [80.8226518642952]
We study optimization of areas under precision-recall curves (AUPRC), which is widely used for imbalanced tasks.
We develop novel momentum methods with a better iteration of $O (1/epsilon4)$ for finding an $epsilon$stationary solution.
We also design a novel family of adaptive methods with the same complexity of $O (1/epsilon4)$, which enjoy faster convergence in practice.
arXiv Detail & Related papers (2021-07-02T16:21:52Z) - Study of List-Based OMP and an Enhanced Model for Direction Finding with
Non-Uniform Arrays [0.0]
This paper proposes an enhanced coarray transformation model (EDCTM) and a mixed greedy maximum likelihood called List-Based Likelihood Orthogonal Matching Pursuit (LBML-OMP)
The proposed EDCTM approach obtains improved estimates when Khatri-Rao product-based models are used to generate difference coarrays under the assumption of uncorrelated sources.
arXiv Detail & Related papers (2021-05-08T20:43:13Z) - 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) - Iterative Algorithm Induced Deep-Unfolding Neural Networks: Precoding
Design for Multiuser MIMO Systems [59.804810122136345]
We propose a framework for deep-unfolding, where a general form of iterative algorithm induced deep-unfolding neural network (IAIDNN) is developed.
An efficient IAIDNN based on the structure of the classic weighted minimum mean-square error (WMMSE) iterative algorithm is developed.
We show that the proposed IAIDNN efficiently achieves the performance of the iterative WMMSE algorithm with reduced computational complexity.
arXiv Detail & Related papers (2020-06-15T02:57:57Z)
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.