Abstract

In the real propagation environments, multipath components (MPCs) in wireless channel usually exist as clusters. Cluster based structure of MPCs has been widely used in wireless channel modeling. In this paper, a novel MPC clustering algorithm is proposed based on spectral clustering. Considering that MPCs having strong power should usually be grouped into different clusters, the algorithm introduces a power-weighted processing to identify the similarity of each MPC. The process of weighting the power is conducted by generating similarity matrix using the full link method of Gaussian kernel function in the traditional spectral clustering algorithm. In order to achieve high clustering accuracy, the dimensionality reduction method of Laplacian Eigenmap is decomposed by using the normalized cut method, the obtained eigenvectors are re-clustered to cut the generated similarity matrix for MPC clustering. In the simulation results, it is found that this algorithm can well separate MPCs with high powers into different clusters and achieves better clustering performance compared with KPowerMeans, Kmeans, and the traditional spectral clustering algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.