A Framework of Multipath Clustering Based on Space-Transformed Fuzzy<i>c</i>-Means and Data Fusion for Radio Channel Modeling
Bibliographic record
Abstract
In the radio channels of cellular networks, signals generally propagate through multiple paths in scattering environments. Multipath Components (MPCs) are shown to be distributed in different groups, known as clusters, in Channel Impulse Responses (CIRs). Clustering MPCs is a critical step in channel measurement and modeling. Many clustering algorithms have been proposed but few of them are able to handle noise effectively. In this paper, we propose a de-noising MPC-clustering framework based on a new Space-Transformed Fuzzy c-Means (ST-FCM) algorithm and the fusion of channel measurement snapshots. ST-FCM solves the issue that the Multipath Component Distance that quantifies the similarity among MPCs cannot be adopted in the conventional FCM algorithm. Then we apply the Dempster-Shafer evidence theory to fuse the clustering results of multiple snapshots, which can detect and remove noise by making a full use of all the measurement data. Furthermore, we design a censoring process for hard partition and a validation process to determine the optimal number of clusters. We have performed extensive simulations on MPC clustering using the CIRs generated by the Third Generation Partnership Project 3-dimensional channel models. We also have developed a space-time channel sounder and have performed experiments in a typical rural macrocell scenario. The simulation and experiment results have shown that the proposed framework has a better performance in clustering accuracy than the current methods.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".