检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]电子科技大学电子工程学院,四川成都610054 [2]成都航空职业技术学院航空电子工程系,四川成都610100
出 处:《电波科学学报》2013年第1期21-27,共7页Chinese Journal of Radio Science
基 金:国家自然科学基金民航联合基金(U1233103);中国博士后科学基金(2012M511919)
摘 要:针对圆形口径平面稀布阵列的多约束优化设计问题,以均匀同心圆环阵列的阵元位置分布特性为基础,构造了稀布圆阵的满足多个优化约束的可行初始解.提出了一种个体元素的间接表示法,设计了一种新的交叉算子和变异算子,运用改进的实数遗传算法优化设计天线阵的阵元位置.优化约束包括阵元数约束、口径约束和最小阵元间距约束,优化目标是使阵列响应的峰值旁瓣电平最小.运用这种改进实数遗传算法可以充分利用阵元布阵的自由度,同时能减小搜索空间,提高计算效率.仿真试验证实了算法的稳健性和有效性.To aim at the optimum design problem of sparse circular plane arrays with multiple constraints, the initial feasible solution which meet multiple design constraints can be made based on the position of uniform concentric circular arrays, and let this solution be the thinning chromosome which is presented for the distri- bution characteristic of the element position with circular boundary. An indirect rep- resentation of individual is presented,and a new crossover and mutation operator is designed. The improved genetic algorithm is used for optimization of sparse plane arrays with circular boundary. The multiple design constraints include the number of element, the aperture and the minimum element spacing, and the optimization ob- jective is to make the sparse plane array produce lower peak sidelobe level (PSLL). A smaller solution space can be searched,the computing efficiency can be improved and the freedom of the element layout can be kept with this improved genetic algo- rithm. Finally, the simulated results confirming the great efficiency and the robust-ness of the new algorithm are shown in this paper.
关 键 词:阵列天线 稀布阵 遗传算法(GA) 旁瓣电平 优化布阵
分 类 号:TN820.15[电子电信—信息与通信工程] TN820.13
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15