Journal of Systems Engineering and Electronics ›› 2009, Vol. 20 ›› Issue (6): 1221-1226.

Previous Articles     Next Articles

Efficient parallel adaptive array beamforming algorithm

Huang Fei, Sheng Weixing & Ma Xiaofeng   

  1. Dept. of Communication Engineering, Nanjing Univ. of Science and Technology, Nanjing 210094, P. R. China
  • Online:2009-12-28 Published:2010-01-03

Abstract:

For a large-scale adaptive array, the heavy computational load and the high-rate data transmission are two challenges in the implementation of an adaptive digital beamforming system. An efficient parallel digital beamforming (DBF) algorithm based on the least mean square algorithm (PLMS) is proposed. An appropriate method is found to partition the least mean square (LMS) algorithm into a number of operational modules, which can be easily executed in a distributed-parallel-processing fashion. As a result, the proposed PLMS algorithm provides an effective solution that can alleviate the bottleneck of high-rate data transmission and reduce the computational cost. PLMS requires less computational load than that of the conventional parallel algorithms based on the recursive least square (RLS) algorithm, as well as it is easier to be implemented to do real time adaptive array processing. Moreover, low sidelobe of the beam pattern is obtained by constraining the static steering vector with Tschebyscheff coefficients. Finally, a scheme of the PLMS algorithm using distributed-parallel-processing system is also proposed. The simulation results demonstrate that the PLMS algorithm has the same interference cancellation performance as that of the conventional LMS algorithm. Moreover, the PLMS algorithm can obtain the same good beamforming performance, regardless how the algorithm is partitioned. It is expected that the proposed algorithm will be used in a large-scale adaptive array system to deal with real time adaptive digital beamforming processing.