检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《电讯技术》2016年第2期166-170,共5页Telecommunication Engineering
摘 要:针对有阵元数和阵列口径约束的矩形平面稀疏阵天线的综合问题,提出了一种基于整数编码的差分进化算法.该方法以每个阵元的栅格位置编号作为设计变量,使阵列的稀疏率满足约束条件,避免了优化过程中的不可行解,还减少了优化变量的个数.为了加速优化过程,采用快速傅里叶变化计算阵列的方向图.以改善阵列峰值副瓣电平为目的进行仿真试验,结果表明:优化后的稀疏天线阵峰值旁瓣电平比现有方法相比改善了1.2-1.7dB,且具有收敛性和稳定性好的优点.For the rectangular planar thinned array with the design constraint of the filling factor,a differen-tial evolution algorithm based on integer code is proposed to reduce the peak sidelobe level( PSLL) . In or-der to avoid the infeasible solution during the optimization,the position number of grid is set as the optimi-zation variable on the premise of the condition that the thinned ratio constraint is satisfied and the variables are reduced. Meanwhile,a fast Fourier transform( FFT) is employed to speed up the calculation of pattern. Then the proposed method is applied to design a low side lobe rectangular planar thinned array. The simu-lated results show that the PSLL is reduced by 1 . 2~1 . 7 dB and good convergence and stability can be a-chieved.
关 键 词:阵列天线 稀疏阵列 差分进化算法 快速傅里叶变换 约束优化
分 类 号:TN821[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229