For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Pattern Synthesis of Sparse Linear Arrays Using Spider Monkey Optimization
Huaning WU Yalong YAN Chao LIU Jing ZHANG
IEICE TRANSACTIONS on Communications
Publication Date: 2017/03/01
Online ISSN: 1745-1345
Type of Manuscript: PAPER
Category: Antennas and Propagation
spider monkey optimization, side lobe levels, null control, and sparse linear array,
Full Text: PDF(1.5MB)
>>Buy this Article
This paper introduces and uses spider monkey optimization (SMO) for synthesis sparse linear arrays, which are composed of a uniformly spaced core subarray and an extended sparse subarray. The amplitudes of all the elements and the locations of elements in the extended sparse subarray are optimized by the SMO algorithm to reduce the side lobe levels of the whole array, under a set of practical constraints. To show the efficiency of SMO, different examples are presented and solved. Simulation results of the sparse arrays designed by SMO are compared with published results to verify the effectiveness of the SMO method.