MétaCan
Menu
Back to cohort
Record W2160373914 · doi:10.1109/twc.2004.826326

A Generalized Linear Quasi-ML Decoder of OSTBCs for Wireless Communications Over Time-Selective Fading Channels

2004· article· en· W2160373914 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 Wireless Communications · 2004
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsFadingChannel state informationComputer scienceDecoding methodsAlgorithmSoft-decision decoderChannel (broadcasting)Block codeBit error rateWirelessInterference (communication)Signal-to-noise ratio (imaging)StatisticsMathematicsTelecommunications

Abstract

fetched live from OpenAlex

We propose a novel generalized linear quasi-maximum-likelihood (quasi-ML) decoder for orthogonal space-time block codes (OSTBCs) for wireless communications over time-selective fading channels. The proposed decoder computes the decision statistics based on the channel-state information and completely removes the intertransmit-antenna interference to provide excellent diversity advantage when the channel varies from symbol to symbol. It is shown that when the channel is quasi-static, the proposed decoder is the optimum ML decoder for OSTBCs. The theoretical bit-error probabilities of the proposed decoder are given and it is shown that the proposed decoder does not exhibit error floors at high signal-to-noise ratios like the decoder proposed in and . Simulation results for various channel-fading rates are presented to verify the theoretical analysis.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.841
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0000.001
Open science0.0030.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.031
GPT teacher head0.302
Teacher spread0.271 · 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