MétaCan
Menu
Back to cohort

Preamble-based Successive Channel Estimation for Multiuser Massive MIMO LoRaWAN with Asynchronous Packets

2025· article· en· W7118698681 on OpenAlexaff
Ebrahim Bedeer

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicIoT Networks and Protocols
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsAsynchronous communicationPreambleChannel (broadcasting)Network packetMIMOChannel state informationSignal-to-noise ratio (imaging)

Abstract

fetched live from OpenAlex

This paper introduces a successive channel estimation method for multiuser massive multiple-input-multiple-output (MIMO) long-range (LoRa) networks with asynchronous (on packet or symbol levels) transmission. The proposed channel estimation method exploits LoRa packets’ preambles as pilot sequences, which enables semi-coherent detection with maximum ratio combining (MRC). The channel state information (CSI) acquisition and data detection are performed in a successive manner in time-of-arrival (ToA) order, where the channel estimation of an end device (ED) is enabled by the detected data of previous (in the ToA order) EDs in the network. To achieve the best channel estimation quality for each ED, we formulate and solve an optimization problem to maximize the preamble power to noise power ratio (PNR). Simulation results show that with the proposed preamble-based CSI acquisition method, massive MIMO LoRa networks can utilize MRC to detect overlapped and asynchronous packets from multiple EDs, at the cost of a reasonable deterioration in error performance as compared to the single ED case.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.971
Threshold uncertainty score0.595

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.007
GPT teacher head0.246
Teacher spread0.238 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicIoT Networks and ProtocolsFrench-language works237,207