WSF Solving Algorithm Based on Limited GA Search Space
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The direction of arrival estimation has been widely employed in Wireless Sensor Networks. This paper proposes a Weighted Subspace Fitting algorithm which can largely reduce the computation amount when doing high-dimensional non-linear optimization by limiting the genetic searching space. This method uses rotation invariant subspace and unbiased estimator of the theoretical minimum error to limit the search space and the complexity of WSF algorithm is reduced by shortening the genetic length of genetic algorithm. The simulation results show that this algorithm has the same performance as the WSF algorithm. Compared with other intelligent optimization algorithms, the proposed algorithm significantly reduces the computational complexity of the algorithm.

    Reference
    Related
    Cited by
Get Citation

蔡丽萍,孙莉,李世宝,陈海华,龚琛.限定GA搜索空间的WSF求解算法.计算机系统应用,2017,26(9):170-175

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 28,2016
  • Revised:
  • Adopted:
  • Online: October 31,2017
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063