无线信道建模中二分 K 均值聚类多径分簇算法
(2023) In Dianbo Kexue Xuebao/Chinese Journal of Radio Science 38(2). p.284-291- Abstract
In order to rationally allocate multi-path component (MPC) of wireless channels to different clusters, a multi-path clustering algorithm based on Bisecting K-means clustering was proposed for millimeter-wave channels to solve the problem of partial optimization of traditional K-means clustering methods. The MPC clustering was implemented based on the cluster split and iteration computation strategy, when the Mahalanobis distance (MD) was regarded as the multipath component distance (MCD). The experiment measurement in indoor millimeter-wave channel was conducted to verify the effectiveness and feasibility of the proposed method. The experimental results show that the clustering result of proposed method is more rational than those of... (More)
In order to rationally allocate multi-path component (MPC) of wireless channels to different clusters, a multi-path clustering algorithm based on Bisecting K-means clustering was proposed for millimeter-wave channels to solve the problem of partial optimization of traditional K-means clustering methods. The MPC clustering was implemented based on the cluster split and iteration computation strategy, when the Mahalanobis distance (MD) was regarded as the multipath component distance (MCD). The experiment measurement in indoor millimeter-wave channel was conducted to verify the effectiveness and feasibility of the proposed method. The experimental results show that the clustering result of proposed method is more rational than those of traditional K-means clustering methods, and the highly correlated MPCs are reasonably and uniquely allocated to the same cluster.
(Less)
- author
- Nie, Yifang ; Mbugua, Allan Wainaina ; Li, Yu ; Yao, Xingyan and Cai, Xuesong LU
- organization
- alternative title
- Multi-path clustering method based on bisecting K-means clustering in wireless channel modeling
- publishing date
- 2023-04
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- bisecting K-means clustering, Mahalanobis distance(MD, millimeter-wave channel modeling, multi-path clustering
- in
- Dianbo Kexue Xuebao/Chinese Journal of Radio Science
- volume
- 38
- issue
- 2
- pages
- 8 pages
- publisher
- Chinese Research Institute of Radiowave Propagation
- external identifiers
-
- scopus:85162745885
- ISSN
- 1005-0388
- DOI
- 10.12265/j.cjors.2022021
- language
- Chinese (Simplified)
- LU publication?
- yes
- id
- 8aae8c05-295b-4072-9283-dc96a8d9612e
- date added to LUP
- 2023-09-20 14:15:39
- date last changed
- 2023-11-21 17:31:13
@article{8aae8c05-295b-4072-9283-dc96a8d9612e, abstract = {{<p>In order to rationally allocate multi-path component (MPC) of wireless channels to different clusters, a multi-path clustering algorithm based on Bisecting K-means clustering was proposed for millimeter-wave channels to solve the problem of partial optimization of traditional K-means clustering methods. The MPC clustering was implemented based on the cluster split and iteration computation strategy, when the Mahalanobis distance (MD) was regarded as the multipath component distance (MCD). The experiment measurement in indoor millimeter-wave channel was conducted to verify the effectiveness and feasibility of the proposed method. The experimental results show that the clustering result of proposed method is more rational than those of traditional K-means clustering methods, and the highly correlated MPCs are reasonably and uniquely allocated to the same cluster.</p>}}, author = {{Nie, Yifang and Mbugua, Allan Wainaina and Li, Yu and Yao, Xingyan and Cai, Xuesong}}, issn = {{1005-0388}}, keywords = {{bisecting K-means clustering; Mahalanobis distance(MD; millimeter-wave channel modeling; multi-path clustering}}, language = {{chi}}, number = {{2}}, pages = {{284--291}}, publisher = {{Chinese Research Institute of Radiowave Propagation}}, series = {{Dianbo Kexue Xuebao/Chinese Journal of Radio Science}}, title = {{无线信道建模中二分 K 均值聚类多径分簇算法}}, url = {{http://dx.doi.org/10.12265/j.cjors.2022021}}, doi = {{10.12265/j.cjors.2022021}}, volume = {{38}}, year = {{2023}}, }