A BFF-Based Attention Mechanism for Trajectory Estimation in mmWave MIMO Communications
Bibliographic record
Abstract
This paper explores a novel Neural Network (NN) architecture suitable for Beamformed Fingerprint (BFF) localization in a millimeter-wave (mmWave) multiple-input multiple-output (MIMO) outdoor system. The mmWave frequency bands have attracted significant attention due to their precise timing measurements, making them appealing for applications demanding accurate device localization and trajectory estimation. The proposed NN architecture captures BFF sequences originating from various user paths, and through the application of learning mechanisms, subsequently estimates these trajectories. Specifically, we propose a method for trajectory estimation, employing a transformer network (TN) that relies on attention mechanisms. This TN-based approach estimates wireless device trajectories using BFF sequences recorded within a mmWave MIMO outdoor system. To validate the efficacy of our proposed approach, numerical experiments are conducted using a comprehensive dataset of radio measurements in an outdoor setting, complemented with ray tracing to simulate wireless signal propagation at 28 GHz. The results illustrate that the TN-based trajectory estimator outperforms other methods from the existing literature and possesses the ability to generalize effectively to new trajectories outside the training dataset.
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.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".