MétaCan
Menu
Back to cohort
Record W2097152760 · doi:10.1109/acssc.2004.1399222

Multiple-channel optimized quantizers for Rayleigh fading channels

2005· article· en· W2097152760 on OpenAlexaff
Yugang Zhou, Wai-Yip Chan, Tiago H. Falk

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsQueen's University
Fundersnot available
KeywordsRayleigh fadingFadingPhase-shift keyingComputer scienceTransmitterChannel (broadcasting)Decoding methodsAlgorithmElectronic engineeringKeyingTelecommunicationsBit error rateEngineering

Abstract

fetched live from OpenAlex

We consider multiple description communication over Rayleigh fading channels with binary phase-shift keying (BPSK) modulators at the transmitter and soft-decision detectors at the receiver. The multiple-channel optimized quantizer design (MCOQD) method, introduced in Y. Zhou et al., (2004) for multiple discrete memoryless channels, is extended to multiple Rayleigh fading channels. The decision thresholds of the soft-decision detectors are optimized to achieve minimum end-to-end distortion. Simulation results show that MCOQD provides more robust quantizers than multiple description scalar quantizers V. Vaishampayan (1993) over Rayleigh fading channels, when both the encoder and decoder are matched to channel statistics and when only the decoder is matched to channel statistics.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.040
GPT teacher head0.305
Teacher spread0.265 · 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 designSimulation or modeling
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

Citations3
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207