MétaCan
Menu
Back to cohort
Record W2036334211 · doi:10.1109/jsac.2005.853791

Noncoherent sequence detection receiver for Bluetooth systems

2005· article· en· W2036334211 on OpenAlexaff
Lutz Lampe, Robert Schober, Manish Jain

Bibliographic record

VenueIEEE Journal on Selected Areas in Communications · 2005
Typearticle
Languageen
FieldComputer Science
TopicBluetooth and Wireless Communication Technologies
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceBluetoothDetectorDiscriminatorDecoding methodsChannel (broadcasting)Interference (communication)Trellis (graph)Real-time computingFilter (signal processing)Sequence (biology)Electronic engineeringAlgorithmWirelessTelecommunications

Abstract

fetched live from OpenAlex

The design of power efficient receivers for Bluetooth systems is a challenging task due to stringent complexity constraints. In this paper, we tackle this problem and present a receiver design consisting of a single filter and a subsequent noncoherent sequence detector. This receiver outperforms the conventional discriminator detector by more than 4 dB for typical Bluetooth channels. Thereby, the proposed noncoherent sequence detection (NSD) algorithm is both favorably low complex as it operates on a two-state trellis and highly robust against channel phase variations caused by low-cost local oscillators. The particular filter design accomplishes effective out-of-band interference suppression. Different from previous work on sequence detector receivers published in the literature, we take possible variations of the Bluetooth modulation parameters into account, and we also devise efficient methods for combined NSD and forward error correction decoding. Hence, the presented receiver design is an attractive solution for practical Bluetooth devices.

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.065
GPT teacher head0.317
Teacher spread0.251 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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

Citations35
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Journal on Selected Areas in CommunicationsSame topicBluetooth and Wireless Communication TechnologiesFrench-language works237,207