Improved Algorithm X for Subarray Partition With Acceleration and Sidelobe Suppression

Ke Miao; Yi Zhang; Chen Yao; Houjun Sun

doi:10.1109/LAWP.2022.3169817

Improved Algorithm X for Subarray Partition With Acceleration and Sidelobe Suppression

Ke Miao, Yi Zhang^*, Chen Yao, Houjun Sun

^*Corresponding author for this work

School of Integrated Circuits and Electronics

Beijing Institute of Technology

Research output: Contribution to journal › Article › peer-review

14 Citations (Scopus)

Abstract

Subarray is widely used in array antennas to decrease the system complexity, which would also increase the sidelobes during scanning. To solve this problem, subarray partition solutions with larger coverage and lower sidelobes are selected from a series of results generated by search algorithms. However, searching for an appropriate result of a large array is time-consuming. In this study, to search subarray solutions of full coverage with less time, we introduce two pruning processes in Algorithm X. Additionally, a pair of coefficients associated with the sidelobes is adopted for further pruning and reducing the sidelobes. Numerical experiments have been carried out and verified the effectiveness and the performance of the proposed method.

Original language	English
Pages (from-to)	1403-1407
Number of pages	5
Journal	IEEE Antennas and Wireless Propagation Letters
Volume	21
Issue number	7
DOIs	https://doi.org/10.1109/LAWP.2022.3169817
Publication status	Published - 1 Jul 2022

Keywords

Algorithm X
array antenna
irregular subarray
sidelobe suppression
subarray partition

Access to Document

10.1109/LAWP.2022.3169817

Cite this

@article{d96b444d5f1f4333b179ca483642bb28,

title = "Improved Algorithm X for Subarray Partition With Acceleration and Sidelobe Suppression",

abstract = "Subarray is widely used in array antennas to decrease the system complexity, which would also increase the sidelobes during scanning. To solve this problem, subarray partition solutions with larger coverage and lower sidelobes are selected from a series of results generated by search algorithms. However, searching for an appropriate result of a large array is time-consuming. In this study, to search subarray solutions of full coverage with less time, we introduce two pruning processes in Algorithm X. Additionally, a pair of coefficients associated with the sidelobes is adopted for further pruning and reducing the sidelobes. Numerical experiments have been carried out and verified the effectiveness and the performance of the proposed method.",

keywords = "Algorithm X, array antenna, irregular subarray, sidelobe suppression, subarray partition",

author = "Ke Miao and Yi Zhang and Chen Yao and Houjun Sun",

note = "Publisher Copyright: {\textcopyright} 2002-2011 IEEE.",

year = "2022",

month = jul,

day = "1",

doi = "10.1109/LAWP.2022.3169817",

language = "English",

volume = "21",

pages = "1403--1407",

journal = "IEEE Antennas and Wireless Propagation Letters",

issn = "1536-1225",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - Improved Algorithm X for Subarray Partition With Acceleration and Sidelobe Suppression

AU - Miao, Ke

AU - Zhang, Yi

AU - Yao, Chen

AU - Sun, Houjun

PY - 2022/7/1

Y1 - 2022/7/1

N2 - Subarray is widely used in array antennas to decrease the system complexity, which would also increase the sidelobes during scanning. To solve this problem, subarray partition solutions with larger coverage and lower sidelobes are selected from a series of results generated by search algorithms. However, searching for an appropriate result of a large array is time-consuming. In this study, to search subarray solutions of full coverage with less time, we introduce two pruning processes in Algorithm X. Additionally, a pair of coefficients associated with the sidelobes is adopted for further pruning and reducing the sidelobes. Numerical experiments have been carried out and verified the effectiveness and the performance of the proposed method.

AB - Subarray is widely used in array antennas to decrease the system complexity, which would also increase the sidelobes during scanning. To solve this problem, subarray partition solutions with larger coverage and lower sidelobes are selected from a series of results generated by search algorithms. However, searching for an appropriate result of a large array is time-consuming. In this study, to search subarray solutions of full coverage with less time, we introduce two pruning processes in Algorithm X. Additionally, a pair of coefficients associated with the sidelobes is adopted for further pruning and reducing the sidelobes. Numerical experiments have been carried out and verified the effectiveness and the performance of the proposed method.

KW - Algorithm X

KW - array antenna

KW - irregular subarray

KW - sidelobe suppression

KW - subarray partition

UR - http://www.scopus.com/inward/record.url?scp=85129412128&partnerID=8YFLogxK

U2 - 10.1109/LAWP.2022.3169817

DO - 10.1109/LAWP.2022.3169817

M3 - Article

AN - SCOPUS:85129412128

SN - 1536-1225

VL - 21

SP - 1403

EP - 1407

JO - IEEE Antennas and Wireless Propagation Letters

JF - IEEE Antennas and Wireless Propagation Letters

IS - 7

ER -

Improved Algorithm X for Subarray Partition With Acceleration and Sidelobe Suppression

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this