MétaCan
Menu
Back to cohort
Record W2137004714 · doi:10.1109/tit.2009.2013001

Performance Analysis and Design Criteria of BICM-ID With Signal Space Diversity for Keyhole Nakagami-$m$ Fading Channels

2009· article· en· W2137004714 on OpenAlexaff
Ha H. Nguyen, Tho Le‐Ngoc

Bibliographic record

VenueIEEE Transactions on Information Theory · 2009
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of SaskatchewanMcGill University
Fundersnot available
KeywordsFadingAdditive white Gaussian noiseAlgorithmNakagami distributionComputer scienceSignal-to-noise ratio (imaging)MathematicsTopology (electrical circuits)Decoding methodsStatisticsTelecommunicationsChannel (broadcasting)Combinatorics

Abstract

fetched live from OpenAlex

This paper generalizes the application bit-interleaved coded modulation with iterative decoding (BICM-ID) using signal space diversity (SSD) overkeyholeNakagami-mfading channels. The tight union bound on the asymptotic error performance is first analytically derived. The near-optimal rotation matrix with respect to both the asymptotic performance and the convergence behavior is then determined. In particular, it is demonstrated that the suitable rotation matrix is the one that has 1) all entries equal in magnitude, 2) a high diversity order, and 3) a large minimum product of the ratios between squared distances to the powermand log-squared distances to the powermof the rotated constellation scaled by factors of signal-to-noise ratio (SNR) and the parameterm. Various analytical and simulation results show that by employing SSD with a sufficiently large dimension, the error performance can closely approach that over an additive white Gaussian noise (AWGN) channel, even in the worst case of keyhole fading.

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.002
metaresearch head score (Gemma)0.013
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: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.013
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.001
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.013
GPT teacher head0.226
Teacher spread0.213 · 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
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

Citations13
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Information TheorySame topicAdvanced Wireless Communication TechniquesFrench-language works237,207