MétaCan
Menu
Back to cohort

Precise BER Computation for Binary Data Detection in Bandlimited White Laplace Noise

2011· article· en· W2165621383 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 Communications · 2011
Typearticle
Languageen
FieldEngineering
TopicUltra-Wideband Communications Technology
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsDetectorBit error rateBandlimitingAlgorithmNoise (video)Electronic engineeringComputer scienceWhite noiseFadingMatched filterMathematicsTelecommunicationsEngineeringDecoding methods

Abstract

fetched live from OpenAlex

Investigation into the characteristics and behaviours of Laplace noise is of crucial importance for evaluating the performance of communication systems operating in impulsive noise, as well as for ultra-wideband wireless systems operating in the presence of multi-user interference. The bit error rate performances of a binary data communication system operating in the presence of additive bandlimited white Laplace noise is analyzed theoretically. A theoretical expression for the average bit error rate is derived using the Beaulieu series for the optimal soft-limiting detector and the matched-filter detector when arbitrary pulse shapes are used. The bit error rate performance of a reduced complexity version of the optimal detector, the hard-limiting detector, and a reduced complexity version of the matched-filter detector, the sum-of-samples detector, are also analyzed. The analytical expressions for the bit error rate are validated by numerical examples.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.939
Threshold uncertainty score0.986

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.000
Research integrity0.0000.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.078
GPT teacher head0.277
Teacher spread0.199 · 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