| 利用迭代线性约束最小二乘方法实现不规则阵列的方向图综合 |
| |
| 引用本文： | 陆必应,梁甸农. 利用迭代线性约束最小二乘方法实现不规则阵列的方向图综合[J]. 国防科技大学学报, 2005, 27(6): 77-81 |
| |
| 作者姓名： | 陆必应 梁甸农 |
| |
| 作者单位： | 国防科技大学,电子科学与工程学院,湖南,长沙,410073 |
| |
| 摘 要： | 研究了用自适应波束形成技术实现不规则阵列的方向图综合问题,改进了应用于方向图综合的迭代线性约束最小二乘方法,改进后的算法提高了数值稳定性和对随机稀疏阵的适应性。对特定的阵列如果指定的理想方向图无法达到,该算法可以获得最好的逼近。仿真结果验证了算法的性能。
|
| 关 键 词： | 方向图综合 不规则稀疏阵 线性约束最小二乘法 |
| 文章编号： | 1001-2486(2005)06-0077-05 |
| 收稿时间： | 2005-06-24 |
| 修稿时间： | 2005-06-24 |
The Synthesis of Nonuniform Array Pattern by Using Iterative Linear Constraints Least Square Method |
| |
| LU Biying and LIANG Diannong. The Synthesis of Nonuniform Array Pattern by Using Iterative Linear Constraints Least Square Method[J]. Journal of National University of Defense Technology, 2005, 27(6): 77-81 |
| |
| Authors: | LU Biying and LIANG Diannong |
| |
| Affiliation: | College of Electronic Science and Engineering, National Univ. of Defense Technology, Changsha 410073,China;College of Electronic Science and Engineering, National Univ. of Defense Technology, Changsha 410073,China |
| |
| Abstract: | The pattern synthesis algorithm for arbitrary arrays using adaptive beamforming method is discussed.An improved iterative linear constraints least square algorithm is presented.The new algorithm exhibits numerical robust and can be used with random sparse arrays.The algorithm finds the best attainable pattern with the given array if the pattern specifications cannot be met.Numerical examples are presented to illustrate the performance of the algorithm. |
| |
| Keywords: | pattern synthesis nonuniform sparse array linear constraints least square |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
|
点击此处可从《国防科技大学学报》下载免费的PDF全文 |
