Performance Analysis and Computational Complexity Comparison of Sequence Detection Receivers With No Explicit Channel Estimation
Bibliographic record
Abstract
We consider a single-input-multiple-output (SIMO) fading channel that can be assumed static over a duration of L symbols. We show that the generalized likelihood ratio test (GLRT) receiver for detecting a block of L uncoded symbols does not require channel-state information (CSI). By deriving an exact closed-form pairwise error probability expression for the detector over slowly time-varying Rayleigh fading, we show that its performance approaches that of coherent detection with perfect CSI when L becomes large. To detect a very long sequence of S symbols over a channel that can be assumed to remain static only over L symbols, where S ≫ L, while keeping computational complexity low, we consider three pilot-based algorithms, namely, the trellis search algorithm, pilot-symbol-assisted block detection, and decision-aided block detection. We compare them with the two existing block-by-block detection algorithms, namely, lattice decoding and sphere decoding, and show the former's advantages in complexity and 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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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 teacher head, 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".