Reduction of Dynamic Range Ratio through Competition Over Resources to synthesize planar array antennas

详细信息    查看全文

• 作者：Reza Gholami ^{reza.gholami@stu.nit.ac.ir" class="auth_mail" title="E-mail the corresponding author} ; Bijan Zakeri ; ^{zakeri@nit.ac.ir" class="auth_mail" title="E-mail the corresponding author} ; Hajar Abedi ^{abedi.hajar@yahoo.com" class="auth_mail" title="E-mail the corresponding author} ; Sina Mohseni ^{sina.mohseni@stu.nit.ac.ir" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Antenna arrays ; Broad null ; Dynamic Range Ratio ; Competition Over Resources ; Null control ; Pattern synthesis
• 刊名：AEU - International Journal of Electronics and Communications
• 出版年：2016
• 出版时间：November 2016
• 年：2016
• 卷：70
• 期：11
• 页码：1522-1531
• 全文大小：1693 K

文摘

To synthesize planar arrays, a new optimization algorithm namely Competition Over Resources (COR) is presented. This method imposes deeper nulls with the constraint of Side Lobe Level (SLL). COR is a new meta-heuristic algorithm based on competitive behavior of animal groups over food resources. The algorithm restricts Dynamic Range Ratio (DRR) in order to achieve a better control of the mutual coupling and feed network. Simulation results for optimal patterns, possessing multiple and broad nulls, are presented. The approach is implemented based on the position-only and the space/amplitude optimization. Furthermore, in order to find the better performance in imposing deeper nulls and reducing SLL, a comparative evaluation between Particle Swarm Optimization (PSO) and COR is presented. Numerical results show that COR has better performance compared with PSO.