Efficient Covariance Matrix Reconstruction with Iterative Spatial Spectrum Sampling

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 approachesComment: 14 pages, 8 figure

Study of Robust Adaptive Beamforming Algorithms Based on Power Method Processing and Spatial Spectrum Matching

Robust adaptive beamforming (RAB) based on interference-plus-noise covariance (INC) matrix reconstruction can experience performance degradation when model mismatch errors exist, particularly when the input signal-to-noise ratio (SNR) is large. In this work, we devise an efficient RAB technique for dealing with covariance matrix reconstruction issues. The proposed method involves INC matrix reconstruction using an idea in which the power and the steering vector of the interferences are estimated based on the power method. Furthermore, spatial match processing is computed to reconstruct the desired signal-plus-noise covariance matrix. Then, the noise components are excluded to retain the desired signal (DS) covariance matrix. A key feature of the proposed technique is to avoid eigenvalue decomposition of the INC matrix to obtain the dominant power of the interference-plus-noise region. Moreover, the INC reconstruction is carried out according to the definition of the theoretical INC matrix. Simulation results are shown and discussed to verify the effectiveness of the proposed method against existing approaches.Comment: 7 pages, 2 figure

Studying protein–protein affinity and immobilized ligand–protein affinity interactions using MS-based methods

This review discusses the most important current methods employing mass spectrometry (MS) analysis for the study of protein affinity interactions. The methods are discussed in depth with particular reference to MS-based approaches for analyzing protein–protein and protein–immobilized ligand interactions, analyzed either directly or indirectly. First, we introduce MS methods for the study of intact protein complexes in the gas phase. Next, pull-down methods for affinity-based analysis of protein–protein and protein–immobilized ligand interactions are discussed. Presently, this field of research is often called interactomics or interaction proteomics. A slightly different approach that will be discussed, chemical proteomics, allows one to analyze selectivity profiles of ligands for multiple drug targets and off-targets. Additionally, of particular interest is the use of surface plasmon resonance technologies coupled with MS for the study of protein interactions. The review addresses the principle of each of the methods with a focus on recent developments and the applicability to lead compound generation in drug discovery as well as the elucidation of protein interactions involved in cellular processes. The review focuses on the analysis of bioaffinity interactions of proteins with other proteins and with ligands, where the proteins are considered as the bioactives analyzed by MS

Mean-square deviation analysis of the zero-attracting variable step-size LMS algorithm

The well-known variable step-size least-mean-square (VSSLMS) algorithm provides faster convergence rate while maintaining lower mean-square error than the conventional LMS algorithm. The performance of the VSSLMS algorithm can be improved further in a channel estimation problem if the impulse response of the channel is sparse. Recently, a zero-attracting (ZA)-VSSLMS algorithm was proposed to exploit the sparsity of a channel. This was done by imposing an l(1) -norm penalty to the original cost function of the VSSLMS algorithm which utilizes the sparsity in the filter taps during the adaptation process. In this paper, we present the mean-square deviation (MSD) analysis of the ZA-VSSLMS algorithm. A steady-state MSD expression for the ZA-VSSLMS algorithm is derived. An upper bound of the zero-attractor controller (p) that provides the minimum MSD is also provided. Moreover, the effect of the noise distribution on the MSD performance is shown theoretically. It is shown that the theoretical and simulation results of the algorithm are in good agreement with a wide range of parameters, different channel, input signal, and noise types