Volume 35 Issue 2
Dec.  2017
Article Contents
Article Navigation >  Journal of University of Electronic Science and Technology of China  > 2006  >  35(2): 189-192

CHEN Ke-song, HE Zi-shu, HAN Chun-lin. Two Enumerate Algorithms Applied to Thinned Arrays Synthesis[J]. Journal of University of Electronic Science and Technology of China, 2006, 35(2): 189-192.
Citation: CHEN Ke-song, HE Zi-shu, HAN Chun-lin. Two Enumerate Algorithms Applied to Thinned Arrays Synthesis[J]. Journal of University of Electronic Science and Technology of China, 2006, 35(2): 189-192.
shu

Two Enumerate Algorithms Applied to Thinned Arrays Synthesis

  • 1.

    School of Electronic Engineering,UEST of China Chengdu 610054

  • Received Date: 2005-03-15
  • Publish Date: 2006-04-15
  • In the process of exhaustive synthesis of thinned arrays(whose elements are thinned from the uniform grid), enumerating the configuration of linear thinned arrays is main task of design. Followed by the analyses of element spacing synthesis, two enumerate algorithms of exhaustive study on configuration of linear thinned arrays are proposed in this paper, they are recursion algorithm and binary sequence enumerate algorithm. Some comparison studies on their performance are made in order to reveal the doable relations with the thinned ratio and aperture of the arrays. The results of computer simulation show the efficiency and applicability of the algorithms respectively. Finally, their performance trials reveal the applicability when they are applied to element spacing synthesis.
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索
Get Citation
PDF
XML

Article Metrics

Article views(3715) PDF downloads(143) Cited by()

Related
Proportional views

Two Enumerate Algorithms Applied to Thinned Arrays Synthesis

  • 1. School of Electronic Engineering,UEST of China Chengdu 610054
  • Received Date: 2005-03-15
  • Publish Date: 2006-04-15

Abstract: In the process of exhaustive synthesis of thinned arrays(whose elements are thinned from the uniform grid), enumerating the configuration of linear thinned arrays is main task of design. Followed by the analyses of element spacing synthesis, two enumerate algorithms of exhaustive study on configuration of linear thinned arrays are proposed in this paper, they are recursion algorithm and binary sequence enumerate algorithm. Some comparison studies on their performance are made in order to reveal the doable relations with the thinned ratio and aperture of the arrays. The results of computer simulation show the efficiency and applicability of the algorithms respectively. Finally, their performance trials reveal the applicability when they are applied to element spacing synthesis.

CHEN Ke-song, HE Zi-shu, HAN Chun-lin. Two Enumerate Algorithms Applied to Thinned Arrays Synthesis[J]. Journal of University of Electronic Science and Technology of China, 2006, 35(2): 189-192.
Citation: CHEN Ke-song, HE Zi-shu, HAN Chun-lin. Two Enumerate Algorithms Applied to Thinned Arrays Synthesis[J]. Journal of University of Electronic Science and Technology of China, 2006, 35(2): 189-192.
shu

    HTML

Catalog

    Journal Online

    Author's Notes

    Links

    Copyright © 《电子科技大学学报》编辑部

    Address: Room 350, central building, University of Electronic Science and Technology, No.4, Section 2, Jianshe North Road, Chengdu Tel: 028-83202308,83207559 Email: xuebao@uestc.edu.cn

    本系统由 北京仁和汇智信息技术有限公司 开发 

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return