Subarray partition based on sparse array weighted K‐means clustering

Abstract This paper introduces the subarray partition based on the sparse array weighted K‐means clustering method, which extends the conventional K‐means clustering method through the inclusion of a weight matrix approach. This matrix is derived by recording the frequency of each element's occurrence across multiple independent sparse arrays, thereby generating a frequency matrix. The performance of SWKCM is demonstrated through simulations and comparisons with four similar methods. To assess the effectiveness and superiority of the SWKCM, it is applied to the subarray partition of a 40×40 uniform planar phased array and compared with the other four methods. The simulation results show that the proposed SWKCM method maintains comparable sidelobe suppression capabilities to those of KCM, achieving a normalized peak sidelobe level of ‐43.1076 dB. Furthermore, compared to the K‐means clustering method, the sparse array weighted K‐means clustering method significantly enhances the stability of subarray partition outcomes, as evidenced by a reduction in the peak sidelobe level standard deviation from 1.0991 to 0.8104, resulting in a 26.3% decrease in variability.

Authors

Institutions

Publication Details

Journal
Electronics Letters
Published
2024-09-01
DOI
https://doi.org/10.1049/ell2.70042
Citations
3
Primary Topic
Direction-of-Arrival Estimation Techniques
Type
article
Field-Weighted Citation Impact
1.05
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Subarray partition based on sparse array weighted K‐means clustering

Jiayu Zhao, Naibo Zhang, Jianming Huang, Yansong Cui et al.
3 citations
Electronics Letters
Direction-of-Arrival Estimation Techniques
1.05
article

Subarray partition based on sparse array weighted K‐means clustering

Jiayu Zhao, Naibo Zhang, Jianming Huang, Yansong Cui, Zilai Wang, Yuxuan Wang
article en
3 citations

Abstract

Abstract This paper introduces the subarray partition based on the sparse array weighted K‐means clustering method, which extends the conventional K‐means clustering method through the inclusion of a weight matrix approach. This matrix is derived by recording the frequency of each element's occurrence across multiple independent sparse arrays, thereby generating a frequency matrix. The performance of SWKCM is demonstrated through simulations and comparisons with four similar methods. To assess the effectiveness and superiority of the SWKCM, it is applied to the subarray partition of a 40×40 uniform planar phased array and compared with the other four methods. The simulation results show that the proposed SWKCM method maintains comparable sidelobe suppression capabilities to those of KCM, achieving a normalized peak sidelobe level of ‐43.1076 dB. Furthermore, compared to the K‐means clustering method, the sparse array weighted K‐means clustering method significantly enhances the stability of subarray partition outcomes, as evidenced by a reduction in the peak sidelobe level standard deviation from 1.0991 to 0.8104, resulting in a 26.3% decrease in variability.

Electronics LettersVol. 60(18)
Beijing University of Posts and Telecommunications (CN), China Electronics Technology Group Corporation (CN), Institute of Electronics (CN)
Openalex Percentile: Top 23%
Direction-of-Arrival Estimation Techniques
1.05
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.