Automated Identification of Clusters in UWB Channel Impulse Responses
Bibliographic record
Abstract
The tendency for the multipath components (MPCs) in wideband channel impulse responses (CIRs) to appear in clusters that are characterized by their own arrival and decay rates was first observed over twenty years ago by Saleh and Valenzuela. Cluster identification is thus an obvious and essential first step in the channel modeling process. However, despite the tremendous effort that has been applied to ultra wideband (UWB) channel modeling by groups such as IEEE 802.15.3a and 802.15.4a in recent years, clusters are still usually identified through time-consuming manual techniques that rely on subjective assessment by the analyst. This presents a significant limitation to development of channel models applicable to new environments. Our algorithm for automated identification of clusters in UWB CIRs seeks to overcome these limitations by making cluster identification less subjective and less time consuming. The starting point for the algorithm is expression of the UWB power delay profile (PDP) on a semi-logarithmic scale so that exponential decay profiles will be displayed as straight lines with constant slopes. After the most significant MPCs have been identified by searching for local maxima within the PDP, an iterative procedure is used to determine the combination of straight lines that best fit these MPCs and thereby not exceed a threshold for RMS error. The number of clusters that are required is defined by number of straight lines while the slopes of the lines define the cluster decay rate. By assuming that incrementing the number of clusters used to represent a CIR will always involve subdividing an existing cluster, we reduce the number of combinations dramatically (and make the algorithm tractable). Cluster identification trials conducted using UWB CIRs generated using a simulation code developed by the IEEE 802.15.4a channel modeling committee have confirmed the validity of our approach.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.002 |
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".