Equalization techniques for space-time coded cooperative systems
Bibliographic record
Abstract
We extend three equalization schemes proposed originally for conventional space-time block codes (STBC) (Lindskog, E. and Paulraj, A., Proc. Int. Conf. Commun., 2000; Al-Dhahir, N., IEEE Commun. Lett., vol.5, no.7, 2001; Liu, Z. et al., Proc. 33rd Asilomar Conf. on Sig., Systems, and Comp., 1999). We extend them to cooperative schemes, carefully exploiting the underlying orthogonality of STBC. These three distributed schemes are named after their conventional counterparts as distributed time-reversal (DTR) STBC, distributed single-carrier (D-SC) STBC and distributed orthogonal frequency division multiplexed (DOFDM) STBC. Considering the special case of single relay employment, our performance analysis for frequency-selective fading channels of memory L demonstrates that the D-TR-STBC and D-SC-STBC schemes are able to achieve a maximum diversity order of 2(L+1) under the assumption of appropriate power control imposed on the relay terminal and high signal-to-noise ratio for the source-to-relay link. Extensive Monte-Carlo simulation results confirm the analytical results.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".