Performance Evaluation and Low-Complexity Detection of the PHY Modulation of LR-FHSS Transmission in IoT Networks
Bibliographic record
Abstract
Long-range frequency-hopping spread spectrum (LR-FHSS) is a new transmission protocol introduced under the long-range wide area network (LoRaWAN) specifications to tackle the issue of extremely long-range and large-scale internet of things (IoT) deployment scenarios. Unlike the other LoRaWanscheme, i.e., the one based on the chirp spread spectrum (CSS) modulation, the physical layer of LR-FHSS exploits a 488 Hz Gaussian minimum shift keying (GMSK) modulation. In this paper, we investigate and model the FHSS-GMSK modulation and evaluate its bit error rate (BER) performance in the LR-FHSS system using simulations. We also propose a low-complexity GMSK signal detection scheme that can be used at the gateway (GW) of an IoT network with a massive number of IoT end devices (EDs). Using computer simulations, we show that our proposed detector can offer a tradeoff between the complexity of the receiver and the bit error rate (BER) performance.
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.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".