Iterative channel estimation and decoding of turbo-coded OFDM symbols in selective Rayleigh channel
Bibliographic record
Abstract
This work deals with the detection of turbo-coded symbols in orthogonal frequency-division multiplexed (OFDM) systems. OFDM symbol detection requires channel estimation, which is often carried out using known pilots. In this paper, an iterative detector composed of a turbo decoder and a channel estimator is proposed. These modules perform jointly and exchange soft information through an iterative process. The decoder consists of the maximum a posteriori Bahl-Cocke-Jelinek-Raviv (MAP-BCJR) algorithm, and the channel estimator is based on the minimum mean-square error (MMSE) criterion. The proposed approach allows for the use of all available information, increases the quality of channel estimation, and improves the system performance. This paper also proposes a new expression of the channel reliability factor used by the MAP-BCJR decoding algorithm. This metric depends on signal-to-noise ratio and the channel estimation error variance. The effect of the channel reliability factor and of the channel estimation error are investigated.
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.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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.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".