Vol. 60
Latest Volume
All Volumes
PIERM 130 [2024] PIERM 129 [2024] PIERM 128 [2024] PIERM 127 [2024] PIERM 126 [2024] PIERM 125 [2024] PIERM 124 [2024] PIERM 123 [2024] PIERM 122 [2023] PIERM 121 [2023] PIERM 120 [2023] PIERM 119 [2023] PIERM 118 [2023] PIERM 117 [2023] PIERM 116 [2023] PIERM 115 [2023] PIERM 114 [2022] PIERM 113 [2022] PIERM 112 [2022] PIERM 111 [2022] PIERM 110 [2022] PIERM 109 [2022] PIERM 108 [2022] PIERM 107 [2022] PIERM 106 [2021] PIERM 105 [2021] PIERM 104 [2021] PIERM 103 [2021] PIERM 102 [2021] PIERM 101 [2021] PIERM 100 [2021] PIERM 99 [2021] PIERM 98 [2020] PIERM 97 [2020] PIERM 96 [2020] PIERM 95 [2020] PIERM 94 [2020] PIERM 93 [2020] PIERM 92 [2020] PIERM 91 [2020] PIERM 90 [2020] PIERM 89 [2020] PIERM 88 [2020] PIERM 87 [2019] PIERM 86 [2019] PIERM 85 [2019] PIERM 84 [2019] PIERM 83 [2019] PIERM 82 [2019] PIERM 81 [2019] PIERM 80 [2019] PIERM 79 [2019] PIERM 78 [2019] PIERM 77 [2019] PIERM 76 [2018] PIERM 75 [2018] PIERM 74 [2018] PIERM 73 [2018] PIERM 72 [2018] PIERM 71 [2018] PIERM 70 [2018] PIERM 69 [2018] PIERM 68 [2018] PIERM 67 [2018] PIERM 66 [2018] PIERM 65 [2018] PIERM 64 [2018] PIERM 63 [2018] PIERM 62 [2017] PIERM 61 [2017] PIERM 60 [2017] PIERM 59 [2017] PIERM 58 [2017] PIERM 57 [2017] PIERM 56 [2017] PIERM 55 [2017] PIERM 54 [2017] PIERM 53 [2017] PIERM 52 [2016] PIERM 51 [2016] PIERM 50 [2016] PIERM 49 [2016] PIERM 48 [2016] PIERM 47 [2016] PIERM 46 [2016] PIERM 45 [2016] PIERM 44 [2015] PIERM 43 [2015] PIERM 42 [2015] PIERM 41 [2015] PIERM 40 [2014] PIERM 39 [2014] PIERM 38 [2014] PIERM 37 [2014] PIERM 36 [2014] PIERM 35 [2014] PIERM 34 [2014] PIERM 33 [2013] PIERM 32 [2013] PIERM 31 [2013] PIERM 30 [2013] PIERM 29 [2013] PIERM 28 [2013] PIERM 27 [2012] PIERM 26 [2012] PIERM 25 [2012] PIERM 24 [2012] PIERM 23 [2012] PIERM 22 [2012] PIERM 21 [2011] PIERM 20 [2011] PIERM 19 [2011] PIERM 18 [2011] PIERM 17 [2011] PIERM 16 [2011] PIERM 14 [2010] PIERM 13 [2010] PIERM 12 [2010] PIERM 11 [2010] PIERM 10 [2009] PIERM 9 [2009] PIERM 8 [2009] PIERM 7 [2009] PIERM 6 [2009] PIERM 5 [2008] PIERM 4 [2008] PIERM 3 [2008] PIERM 2 [2008] PIERM 1 [2008]
2017-09-18
A Novel Binary Butterfly Mating Optimization Algorithm with Subarray Strategy for Thinning of Large Antenna Array
By
Progress In Electromagnetics Research M, Vol. 60, 101-110, 2017
Abstract
This paper presents a novel binary algorithm named as binary butterfly mating algorithm (BBMO) combined with sub-array strategy for thinning of antenna array. The proposed algorithm has been adapted from a recently developed nature inspired optimization, butterfly mating optimization (BMO). The subarray strategy is dividing the linear array into two parts, one part with a fixed number of element turned on in the middle of array and the rest elements on the edge of array composing another subarray. In order to reduce the complexity of the thinning process, BBMO algorithm is used to optimize the element on the edge of an array. The proposed BBMO with subarray strategy is used to synthesize a linear sparse antenna array in order to reduce maximum sidelobe level and at the same time keeping the percentage of thinning equal to or more than the desired level. To evaluate the performance of the proposed thinning method, a linear array with 100 elements is optimized by BBMO algorithm without and with subarray strategy. And we discuss the impact of number of fixed elements on thinning results. The novel method BBMO with subarray strategy gives reduced SLL as compared to the results available in literature of ant colony algorithm, genetic algorithm, binary differential evolution algorithm, chaotic binary particle swarm optimization, and improved binary invasive weed optimization algorithm. Moreover, the convergence rate of BBMO with subarray strategy is faster than BBMO without subarray strategy and the other methods.
Citation
Huaning Wu, Chao Liu, Bin Li, and Xu Xie, "A Novel Binary Butterfly Mating Optimization Algorithm with Subarray Strategy for Thinning of Large Antenna Array," Progress In Electromagnetics Research M, Vol. 60, 101-110, 2017.
doi:10.2528/PIERM17071802
References

1. Haupt, R. L., "Thinned arrays using genetic algorithms," IEEE Trans. Antennas and Propagation, Vol. 42, No. 7, 993-999, July 1994.
doi:10.1109/8.299602

2. Wang, X.-K., Y.-C. Jiao, Y. Liu, and Y. Y. Tan, "Synthesis of large planar thinned arrays using IWO-IFT algorithm," Progress In Electromagnetics Research, Vol. 136, 29-42, 2013.

3. Bucci, O. M., T. Isernia, and A. F. Morabito, "A deterministic approach to the synthesis of pencil beams through planar thinned array," Progress In Electromagnetics Research, Vol. 101, 217-230, 2010.
doi:10.2528/PIER10010104

4. Quevedo-Teruel, O. S. and E. Rajo-Iglesias, "Ant colony optimization in thinned array synthesis with minimum sidelobe level," IEEE Antennas and Wireless Propagation Letters, Vol. 5, No. 1, 349-352, February 2006.
doi:10.1109/LAWP.2006.880693

5. Zhang, L., Y. C. Jiao, Z. B. Weng, and F. S. Zhang, "Design of planar thinned arrays using a boolean differential evolution algorithm," IET Microwaves, Antennas and Propagation, Vol. 4, No. 12, 2172-2178, December 2010.
doi:10.1049/iet-map.2009.0630

6. Wang, W.-B., Q. Feng, and D. Liu, "Synthesis of thinned linear and planar antenna arrays using binary PSO algorithm," Progress In Electromagnetics Research, Vol. 127, 371-387, 2012.
doi:10.2528/PIER12020301

7. Liu, C. and H. Wu, "Synthesis of thinned array with side lobe levels reduction using improved binary invasive weed optimization," Progress In Electromagnetics Research M, Vol. 37, 21-30, 2014.

8. Oliveri, G., M. Donelli, and A. Massa, "Linear array thinning exploiting almost difference sets," IEEE Trans. Antennas and Propagation, Vol. 57, No. 12, 3800-3812, December 2009.
doi:10.1109/TAP.2009.2027243

9. Rocca, P., "Large array thinning by means of deterministic binary sequences," IEEE Trans. Antennas and Wireless Propagation Letters, Vol. 10, No. 4, 334-337, October 2011.

10. Jayasinghe, J. W., J. Anguera, and D. N. Uduwawala, "A high-directivity microstrip patch antenna design by using genetic algorithm optimization," Progress In Electromagnetics Research C, Vol. 37, 131-144, 2013.
doi:10.2528/PIERC13010805

11. Jada, C., A. K. Vadathya, A. Shaik, S. Charugundla, P. R. Ravula, and K. K. Rachavarapu, "Butterfly mating optimization," Advances in Intelligent Systems and Computing, Vol. 384, 3-15, Springer International Publishing, 2016.