Self-Matching Space-Time Block Codes for Matrix Kalman Estimator-Based ML Detector in MIMO Fading Channels
Bibliographic record
Abstract
This paper presents a unifying framework for designing a joint channel-estimation-and-data-detection (CE/DD) scheme and space-time block code (STBC) that improves the performances in a multiple-input-multiple-output (MIMO) slow flat Rayleigh fading channel. Modeling the channel using the continuous-fading model, a matrix state-space model, which naturally represents the temporal and spatial dimensions of a MIMO system, is introduced. A consistent and novel matrix CE/DD scheme is developed using a matrix Kalman filter and a matrix normalized-innovations-based maximum-likelihood detector. In MIMO CE/DD in multiplicative fading, symmetric STBCs (S-STBCs) cause isometric data sequences, which lead to a detection error floor. Motivated by the minimization of the probability of error, two asymmetric STBCs are introduced to be used with these S-STBCs to mitigate isometry. To further improve detection performance, a self-matching STBC (SM-STBC), which mitigates isometry using asymmetry, improves estimation performance using training, and improves detection performance by adapting its code properties, is introduced. This SM-STBC generalizes a limited version that was previously proposed. A comprehensive analysis, which is supported by some simulation studies, indicates that the proposed framework of transceiver and STBC designs offers excellent detection performance.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".