pith. sign in

arxiv: 1505.06788 · v1 · pith:LCGMPOQTnew · submitted 2015-05-26 · 💻 cs.IT · math.IT

Low-Complexity Robust Adaptive Beamforming Algorithms Based on Shrinkage for Mismatch Estimation

classification 💻 cs.IT math.IT
keywords adaptivealgorithmsbeamforminglow-complexitymatrixmismatchshrinkagealgorithm
0
0 comments X p. Extension
pith:LCGMPOQT Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{LCGMPOQT}

Prints a linked pith:LCGMPOQT badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

In this paper, we propose low-complexity robust adaptive beamforming (RAB) techniques that based on shrinkage methods. The only prior knowledge required by the proposed algorithms are the angular sector in which the actual steering vector is located and the antenna array geometry. We firstly present a Low-Complexity Shrinkage-Based Mismatch Estimation (LOCSME) algorithm to estimate the desired signal steering vector mismatch, in which the interference-plus-noise covariance (INC) matrix is estimated with Oracle Approximating Shrinkage (OAS) method and the weights are computed with matrix inversions. We then develop low-cost stochastic gradient (SG) recursions to estimate the INC matrix and update the beamforming weights, resulting in the proposed LOCSME-SG algorithm. Simulation results show that both LOCSME and LOCSME-SG achieve very good output signal-to-interference-plus-noise ratio (SINR) compared to previously reported adaptive RAB algorithms.

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.