Sequence Detection and Adaptive Channel Estimation for ISI Channels Under Class-A Impulsive Noise
Bibliographic record
Abstract
In this paper, sequence detection and channel estimation for frequency-selective, intersymbol interference (ISI)-producing channels under Class-A impulsive noise are considered. We introduce a novel suboptimum sequence detection (SSD) scheme and show that although SSD employs a simplified metric, it achieves practically the same performance as maximum-likelihood sequence detection (MLSD). For both SSD and MLSD, a lower bound on the achievable performance is derived, which is similar to the classical matched-filter bound for frequency-selective (fading) channels under Gaussian noise. For channel estimation, we adopt a minimum entropy criterion and derive efficient least-mean-entropy and recursive least-entropy algorithms. For both adaptive algorithms, we analyze the steady-state channel-estimation error variance. Theoretical considerations and simulation results show that in Class-A impulsive noise, the proposed sequence detection and adaptive channel-estimation schemes yield significant performance gains over their respective conventional counterparts (designed for Gaussian noise). Although the novel algorithms require knowledge of the Class-A noise-model parameters, their computational complexity is comparable to that of the corresponding conventional algorithms.
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.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".