MétaCan
Menu
Back to cohort
Record W2159690431 · doi:10.1109/tcomm.2009.12.080231

Approximate BER Expressions of Distributed Alamouti's Code in Dissimilar Cooperative Networks with Blind Relays

2009· article· en· W2159690431 on OpenAlexaff
Zhihang Yi, I.-M. Kim

Bibliographic record

VenueIEEE Transactions on Communications · 2009
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsQueen's University
Fundersnot available
KeywordsBit error rateCode (set theory)AlgorithmSignal-to-noise ratio (imaging)Computer scienceTransmission (telecommunications)Channel (broadcasting)Range (aeronautics)Expression (computer science)Topology (electrical circuits)MathematicsTheoretical computer scienceTelecommunicationsDecoding methodsCombinatoricsEngineering

Abstract

fetched live from OpenAlex

This paper focuses on error performance analysis of distributed Alamouti's code. Recently, many works have been devoted to the performance analysis of this code. In order to simplify the analysis, however, they either assumed the channels in the cooperative network had the same variances or only considered asymptotic error performance at high signal-to-noise ratio (SNR) range. In this paper, we study a general dissimilar cooperative network, where the channels have different variances. Two accurate approximate bit error rate (BER) expressions are proposed in order to evaluate the error performance of the distributed Alamouti's code. We also investigate how the values of channel variances affect the accuracies of the proposed approximate BER expressions. Our results demonstrate that the proposed approximate BER expressions are very close to the exact BER over the whole SNR range. Furthermore, we show that the average BER of the distributed Alamouti's code behaves like <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(ln(E)/E)<sup>2</sup></i> when the transmission power <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">E</i> is sufficiently large.

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

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.002
Science and technology studies0.0010.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.044
GPT teacher head0.297
Teacher spread0.253 · 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 designSimulation or modeling
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

Citations19
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207