Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2012, Vol. 35 ›› Issue (5): 63-67.doi: 10.13190/jbupt.201205.63.yinh

• Papers • Previous Articles     Next Articles

Fast Search Method For Optimal Beam Sequence Selection Based on Pruning Optimization

YIN Hao, YIN Shu-yi, HE Yuan-zhi   

  1. 1. China Electronic Equipment System Engineering Company2. Department of Electronic Engineering, Tsinghua University
  • Received:2011-12-22 Revised:2012-04-19 Online:2012-10-28 Published:2012-07-06
  • Contact: Shu-Yi YIN E-mail:yinshuyisym2009@sina.com

Abstract:

In order to solve problems of the low traverse efficiency and the high cost of optimal beam sequence searching of multiple-beam antenna with large number of typical test beams combination, a fast search algorithm based on the beam pruning optimization sequence is proposed based on the exploration of the relation between beam and feed source array of the incentive coefficient matrix system. By employing the least squares evaluation method and the beam forming principle of the composite beams, the proposed method establishes a criteria in which, the independence and the coverage and the feed contribution rate of typical tested beam combination is guaranteed respectively, and the average estimation error of the feed source is minimized. Simulations show that the algorithm complexity is reduced, the search results are accurate and the efficiency is obviously improved, and the optimal test beams sequence is searched in actual conditions as well. The proposed method can provide an excellent reference value to find the optimal test beams sequence efficiency and accurately for a practical system.

Key words: multiple-beam antenna, feed source array, pruning algorithm, estimation error

CLC Number: