检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]电子工程学院,安徽合肥230037
出 处:《信号处理》2013年第7期846-856,共11页Journal of Signal Processing
基 金:国家自然科学基金(60702015)资助课题
摘 要:本文提出了一种基于最少阵元约束的圆形阵列方向图综合方法。首先,分析了基于l0范数约束时优化模型非凸的原因;其次,利用基于l2和l1混合约束的优化模型对其进行逼近,与传统方法相比,既扩大了搜索的可行域又提高了优化精度;最后,对阵元数已定的圆形阵列的阵元位置和权值进行联合优化,以克服固定栅格点对方向图综合性能的影响。仿真数据验证了本文方法的有效性,在减少阵元数目的同时可进一步降低圆形阵列方向图的峰值旁瓣电平。A pattern synthesis of the circular array with the constraint of minimal arrays is proposed.This method firstly analyzes the reason why the synthesis with the norm constraint of l0 is non-convex.And then the optimal model can be slack as a design problem with mixed norm constraints of l2 and l1.It can not only enlarge the feasible region but also can enhance the accuracy of the optimal results in comparison with the traditional method.Lastly this method makes the location of the array element and the coefficient as joint variables for its optimization model,which can overcome the bad effects to the synthesis of the circular arrays caused by the constant grid point.The experimental results show that much reduction of the arrays and the peak side lobe can be obtained when applying the method presented in this paper.
关 键 词:圆形阵列 序列锥规划 二阶锥规划 旁瓣电平 最少阵元
分 类 号:TN821[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222