Robust widely linear beamforming using estimation of extended covariance matrix and steering vector
Zhen Meng, Weidong Zhou, Saeed Gazor
EURASIP Journal on Wireless Communications and Networking · 2020
doi:10.1186/s13638-020-01830-1 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The distribution of the received signals in many array processing applications is noncircular. Although optimal widely linear beamformer (WLB) can provide the best performance for noncircular received signals, its performance degrades severely under model mismatches in practical applications. As a remedy, we propose a robust WLB by using precise reconstruction of extended interference-plus-noise covariance matrix (EINCM) and low-complexity estimation of extended desired signal steering vector (EDSSV). We propose to first determine the steering vectors, powers, and noncircularity coefficients of all signals and the noise power. In contrast to the previous reconstruction methods using the integration over a wide angular sector, we reconstruct the interference-plus-noise covariance matrix (INCM) and the pseudo INCM accurately according to their definitions. By using INCM and pseudo INCM, we can precisely reconstruct the EINCM. We propose to estimate the EDSSV by intersecting two extended subspaces, which are respectively formed by eigendecomposing the extended sample covariance matrix and the extended desired signal covariance matrix. Unlike the convex optimization methods, the proposed EDSSV estimation does not require any optimization programming and yields a solution with closed expression in low computational complexity. Simulation results show that the proposed robust WLB provides near optimal performance under several model mismatch cases.
Abstract licence: CC BY-NC-ND
References49
40 more references, whose wording the paper’s licence keeps private.
All 49 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.