MétaCan
Menu
Back to cohort
Record W2106834551 · doi:10.1109/tsp.2006.874766

On the Design of Minimum BER Linear Space-Time Block Codes for MIMO Systems Equipped With MMSE Receivers

2006· article· en· W2106834551 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 Signal Processing · 2006
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsMIMOBlock codeMathematicsMinimum mean square errorAlgorithmBit error rateRayleigh fadingQAMUpper and lower boundsQuadrature amplitude modulationControl theory (sociology)FadingComputer scienceDecoding methodsStatisticsBeamforming

Abstract

fetched live from OpenAlex

In this paper, we consider the design of a full-rate linear space-time block code for coherent multiple-input multiple-output (MIMO) communication systems under a quasi-static Rayleigh flat-fading environment. Our design targets specifically at the use of a linear minimum mean-square error (MMSE) receiver that minimizes the asymptotic average bit error rate (BER) when the transmitted signal is selected from a 4-QAM constellation. This optimization problem is solved in two main stages: 1) a lower bound on the BER is first minimized, and 2)how this minimized lower bound can be achieved is then shown. By exploiting a rigorous convex optimization technique without any assumption on the code, we prove that individual unitary and trace-orthogonal structures are the necessary and sufficient conditions to assure the minimum asymptotic average BER with an MMSE detector. An algorithm is provided for an efficient generation of our codes, and simulation results confirm that our optimally designed codes are indeed superior in performance compared to some other commonly used codes.

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 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.963
Threshold uncertainty score0.661

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.0000.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.019
GPT teacher head0.239
Teacher spread0.220 · 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