Code-Aided DOA Estimation From Turbo-Coded QAM Transmissions: Analytical CRLBs and Maximum Likelihood Estimator
Bibliographic record
Abstract
In this paper, we address the problem of direction of arrival (DOA) estimation from turbo-coded square-QAM-modulated transmissions. We devise a new code-aware direction finding concept, derived from maximum likelihood (ML) theory, wherein the soft information provided by the soft-input soft-output decoder, in the form of log-likelihood ratios, is exploited to assist the estimation process. At each turbo iteration, the decoder output is used to refine the ML DOA estimate. The latter is in turn used to perform a more focused receiving beamforming thereby providing more reliable information-bearing sequences for the next turbo iteration. In order to benchmark the new estimator, we also derive the analytical expressions for the exact Cramer-Rao lower bounds (CRLBs) of code-aided (CA) DOA estimates. Simulation results will show that the new CA direction finding scheme lies between the two traditional schemes of completely non-data-aided and data-aided (DA) estimations. Huge performance improvements are achieved by embedding the direction finding and receive beamforming tasks into the turbo iteration loop. Moreover, the new CA DOA estimator reaches the new CA CRLBs over a wide range of practical SNRs thereby confirming its statistical efficiency. As expected intuitively, its performance further improves at higher coding rates and/or lower modulation orders.
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.020 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".