MétaCan
Menu
Back to cohort
Record W2168301531 · doi:10.1109/tvt.2007.897187

Bluetooth Receiver Design Based on Laurent's Decomposition

2007· article· en· W2168301531 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Vehicular Technology · 2007
Typearticle
Languageen
FieldComputer Science
TopicBluetooth and Wireless Communication Technologies
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsBluetoothRobustness (evolution)Computer scienceElectronic engineeringDetectorRadio receiver designTransmission (telecommunications)WirelessEngineeringChannel (broadcasting)TelecommunicationsTransmitter

Abstract

fetched live from OpenAlex

In this paper, we present a receiver design for Bluetooth transmission based on Laurent's decomposition of the Bluetooth transmit signal. The main features of this receiver are 1) its low complexity compared to alternative solutions; 2) its excellent performance close to the theoretical limit; and 3) its high robustness against frequency offsets, phase noise, and modulation index variations, which are characteristic for low-cost Bluetooth devices. In particular, we show that the devised noncoherent decision-feedback equalization receiver achieves a similar performance as a recently proposed two-state noncoherent sequence detector, while it is advantageous in terms of complexity. The new receiver design is therefore highly attractive for a practical implementation.

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.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.869
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.000
Research integrity0.0010.001
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.017
GPT teacher head0.260
Teacher spread0.243 · 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