MétaCan
Menu
Back to cohort
Record W2147723211 · doi:10.1109/vetecf.2004.1400487

Maximum-likelihood detection for distributed space-time block coding

2005· article· en· W2147723211 on OpenAlexaff
Murat Uysal, H. Mheidat

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceAlgorithmFadingViterbi algorithmChannel (broadcasting)Block (permutation group theory)Coding (social sciences)Maximum likelihoodChannel codeBlock codeDecoding methodsMaximum likelihood sequence estimationQuadratic equationEstimation theoryMathematicsTelecommunicationsStatistics

Abstract

fetched live from OpenAlex

We investigate maximum likelihood (ML) sequence estimation for distributed space-time block coded cooperative diversity schemes over time-varying fading channels, without assuming channel knowledge. The quadratic form of the ML receiver in this case does not readily lend itself to efficient implementation. However, under quasi-static channel conditions, the likelihood function reduces to a simple form similar to the classical correlation receiver in matrix notation. It also allows the development of a recursive expression that can be easily implemented by a Viterbi-type algorithm with a reasonable complexity. Although the receiver is sub-optimum for the non-static case, its performance is close to the optimum for a range of SNRs. It also outperforms pilot symbol assisted techniques, which are widely used in practical applications.

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 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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.937
Threshold uncertainty score0.410

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
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.021
GPT teacher head0.258
Teacher spread0.237 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
Domainnot available
GenreMethods

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

Citations22
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207