Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (7): 1577-1580.

Previous Articles     Next Articles

Fast fixed point blind beamforming algorithm for arbitrary non-Gaussian signals

ZHAO Li-quan1,2, YANG Shen-yuan1, JIA Yan-fei3, ZHANG Chao-zhu1   

  1. 1. Coll. of Information and Communication Engineering, Harbin Engineering Univ., Harbin 150001, China;
    2. Coll. of Information Engineering, Northeast Dianli Univ., Jilin 132012, China;
    3. Coll. of Electric and Information Engineering, Beihua Univ., Jilin 132013, China
  • Received:2008-03-12 Revised:2008-12-14 Online:2009-07-20 Published:2010-01-03

Abstract: The step parameters directly affect the performance of the kurtosis maximization blind beamforming algorithm,especially when the information of channels and sources is unknown,so it is difficult to choose step parameters.Two fast fixed point blind beamforming algorithms without any step parameters are proposed for arbitrary non-Gaussian signals.First of all,the dataset is preprocessed by whitening,then the cost function is constructed by using kurtosis maximization and orthogonal weights.Through optimizing the cost function by complex Newton-Like method,the new blind beamforming algorithms are introduced.Compared with the kurtosis maximization blind beamforming algorithm,this proposed algorithms have less error,fast convergence rate and no need of any step parameters,which are more suitable for a unknown channel and source environment.Simulation proves the efficiency of the algorithms.

CLC Number: 

[an error occurred while processing this directive]