资料下载
×
稀疏线阵阵列结构的枚举算法
消耗积分:3 |
格式:rar |
大小:276 |
2009-05-20
分享资料个
通过分析单元从规则栅格中稀疏的稀疏直线阵列的综合问题，得出枚举稀疏线阵所有可能的阵列结构是稀疏阵穷举综合法的重要任务。提出了两种可用于枚举稀疏线阵阵列结构的算法，即递归算法和二进制序列穷举法，并分析比较了稀疏线阵的阵列口径和稀布率与算法性能的关系。计算机仿真结果显示了它们各自的有效性和适用性，最后指明两种算法在稀疏阵综合中适用的场合。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.
声明：本文内容及配图由入驻作者撰写或者入驻合作网站授权转载。文章观点仅代表作者本人，不代表电子发烧友网立场。文章及其配图仅供工程师学习之用，如有内容侵权或者其他违规问题，请联系本站处理。 举报投诉
评论(0)
发评论
- 相关下载
- 相关文章
