Low-complexity parallel-structure symbol-by-symbol detection for ISI channels
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The problem of practical realization of the optimal fixed-delay symbol-by-symbol detection algorithm is investigated. A new structure is developed which is fully parallel with a speedup factor of 2/sup D+1/ (compared to serial implementation), where D is the delay constraint. Through systematic reformulations of the algorithm, a number of simplifications are performed that avoid the complex and slow computations of exponentials and a large number of multiplications, all at the expense of a small lookup table and a number of simple operations involving additions, comparisons, and table lookups. A number of approximations are applied to this simplified parallel symbol (SPS) detector which lead to the derivation of suboptimal detectors. An interesting suboptimal detector so derived is identical in computations to the Viterbi detector. A comparison of the SPS detector and Viterbi detector shows that the former has a slightly better performance at low values of signal-to-noise ratio (SNR) and the latter has a lower complexity at higher values of SNR; otherwise, the two detectors are comparable in performance and complexity.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
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.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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 it