Space-Time Coding Ambiguities in Joint Adaptive Channel Estimation and Detection
Bibliographic record
Abstract
This paper studies the error propagation effect that is caused by certain ambiguities in joint data detection-channel tracking algorithms for transmission diversity schemes. Here, we use a space-time (ST) receiver based on the maximum a posteriori (MAP) method that takes into account the channel estimation error assuming the unknown channel to have a given complex multivariate Gaussian probability density function (pdf) (i.e., a Ricean channel). The decision criterion that is expressed in quadratic form represents either a linear detector or a noncoherent-nonlinear detector in extreme cases. Then, the channel pdf for the next iteration is updated by estimates of the second-order statistics of the channel coefficients, and a very simple decision-directed adaptive algorithm is derived for adaptive channel estimation. The adaptive algorithm can efficiently track a fast Rayleigh fading channel and, as a result, achieves robust performance. However, the occurrence of two types of ambiguities initiated in deep fades result in error propagation. Some remedies called space-time ambiguity remedies (STARs) are proposed to prevent error propagation. A new time-varying space-time coding (TVST) scheme is suggested as a bandwidth-efficient method to combat the permutation ambiguity impairment. This coding scheme, in conjunction with a differential detector, can resolve the ambiguity problem.
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.002 | 0.015 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
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".