Abstract
In the real-world environments, multipath components (MPCs) of wireless channels are generally distributed as groups, i.e., clusters. Modeling the clustered MPCs is important and necessary for channel modeling and an automatic clustering algorithm is thus required. This paper proposes a novel Kernel-power-density (KPD) based algorithm for MPC clustering. It uses the Kernel density to incorporate the modeled behavior of MPCs and takes into account the power of the MPCs. The proposed algorithm only considers the K nearest MPCs in the density estimation to better identify the local density variations of MPCs. Simulations validate the KPD algorithm and almost no performance degradation is found even with a large number of clusters and large cluster angular spread. The KPD algorithm enables applications with no prior knowledge about the clusters such as number and initial locations. It can be used for the cluster based channel modeling for 4G#x002F;5G communications.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
