Robust Adaptive Beamforming with SSMUSIC Performance Optimization in the Presence of Steering Vector Errors

Biao Jiang; Qianliu Cheng; Guomin Ling
June 2007
Journal of Digital Information Management;Jun2007, Vol. 5 Issue 3, p107
Academic Journal
A novel subspace projection approach was proposed to improve the robustness of adaptive beamforming and direction finding algorithms. The cost function of the signal subspace scaled multiple signal classification (SSMUSIC) is minimized in the uncertainty set of the signal steering vector, the optimal solution to the optimization problem is that the assumed steering vector can be modified as the weighed sum of the vectors orthogonally projected onto the signal subspace and the noise subspace. Using the estimated steering vector with small error to the true steering vector, the spectral peaks in the actual signal directions are guaranteed. Consequently, the problem of signal self-canceling encountered by adaptive beamforming due to steering vector mismatches is eliminated. Simulation and lake trial results show that the proposed method not only possesses high resolution performance, but also is robust to a few steering vector errors. Furthermore, the modified MUSIC algorithm outperforms the conventional MUSIC and SSMUSIC methods excellently.


Related Articles

  • New Efficient Iterative Optimization Algorithm to Design the Two Channel QMF Bank. Soni, Ram Kumar; Jain, Alok; Saxena, Rajiv // Enformatika;2006, Vol. 18, p206 

    This paper proposes an efficient method for the design of two channel quadrature mirror filter (QMF) bank. To achieve minimum value of reconstruction error near to perfect reconstruction, a linear optimization process has been proposed. Prototype low pass filter has been designed using Kaiser...

  • Fractional Delay FIR Filters Design with Enhanced Differential Evolution. Walczak, Krzysztof // International Journal of Mathematical, Physical, & Engineering S;2009, Vol. 3 Issue 4, p221 

    Fractional delay FIR filters design method based on the differential evolution algorithm is presented. Differential evolution is an evolutionary algorithm for solving a global optimization problems in the continuous search space. In the proposed approach, an evolutionary algorithm is used to...

  • An Improved Method for Low-sidelobe Beampattern Optimization. Chang-peng Ji; Mei-yu Wu; Yu-jie Yuan; Shuang Liu // Advances in Information Sciences & Service Sciences;Nov2011, Vol. 3 Issue 10, p12 

    For conventional beamforming technology, the anti-jamming performance is not robust, directions of interference signals often needing to be known precisely and side lobe level being high. To solve those detects, a modified low-sidelobe beampattern optimization is proposed here. The proposed...

  • An Opportunistic Array Beamforming Technique Based on Binary Multiobjective Wind Driven Optimization Method. Zhang, Zhenkai; Salous, Sana; Li, Hailin; Tian, Yubo // International Journal of Antennas & Propagation;10/4/2015, Vol. 2015, p1 

    We present a novel binary version of multiobjective wind driven optimization (WDO) for emitted beamforming of opportunistic array radar, which is assumed as a multiobjective optimization problem. Firstly, the emitted signal model and objective functions of optimization are presented. Then the...

  • Non-Convex Compressed Sensing Using Partial Support Information. Ghadermarzy, Navid; Mansour, Hassan; Yılmaz, Özgür // Sampling Theory in Signal & Image Processing;2014, Vol. 13 Issue 3, p249 

    In this paper we address the recovery conditions of weighted lp minimization for signal reconstruction from compressed sensing measurements when partial support information is available. We show that weighted lp minimization with 0 < p < 1 is stable and robust under weaker sufficient conditions...

  • An infeasible-point subgradient method using adaptive approximate projections. Lorenz, Dirk; Pfetsch, Marc; Tillmann, Andreas // Computational Optimization & Applications;Mar2014, Vol. 57 Issue 2, p271 

    We propose a new subgradient method for the minimization of nonsmooth convex functions over a convex set. To speed up computations we use adaptive approximate projections only requiring to move within a certain distance of the exact projections (which decreases in the course of the algorithm)....

  • Compressive sensing: A methodological approach to an efficient signal processing. Astaiza-Hoyos, Evelio; Jojoa-Gómez, Pablo Emilio; Bermúdez-Orozco, Héctor Fabio // Dyna;Aug2015, Vol. 82 Issue 192, p203 

    Compressive Sensing (CS) is a new paradigm for signal acquisition and processing, which integrates sampling, compression, dimensionality reduction and optimization, which has caught the attention of a many researchers; SC allows the reconstruction of dispersed signals in a given domain from a...

  • Adaptive Subcarrier and Bit Allocation for Downlink OFDMA System with Proportional Fairness. Lande, Sudhir B.; Helonde, J. B.; Pande, Rajesh; Pathak, S. S. // International Journal of Wireless & Mobile Networks;Oct2011, Vol. 3 Issue 5, p125 

    This paper investigates the adaptive subcarrier and bit allocation algorithm for OFDMA systems. To minimize overall transmitted power, we propose a novel adaptive subcarrier and bit allocation algorithm based on channel state information (CSI) and quality state information (QSI). A suboptimal...

  • COMMUNICATION AND UNDERSTANDING. Nikolaevich, Romanenko Vladimir; Vasilyevna, Nikitina Galina // Society: Philosophy, History, Culture;2013, Issue 2, p1 

    The world around is perceived by mind as a num-ber of objects. They exchange signals continuous-ly. A part of the signals is inseparable from the nature of the Universe. The living Nature has spe-cial signals to be perceived, they are the basis of the communication. Sometimes the communica-tion...

  • Numerical Optimization within Vector of Parameters Estimation in Volatility Models. Arneric, J.; Rozga, A. // Proceedings of World Academy of Science: Engineering & Technolog; 

    In this paper usefulness of quasi-Newton iteration procedure in parameters estimation of the conditional variance equation within BHHH algorithm is presented. Analytical solution of maximization of the likelihood function using first and second derivatives is too complex when the variance is...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics