A new framework for soft decision equalization in frequency selective MIMO channels
Bibliographic record
Abstract
We introduce a novel framework for soft-input, soft-output (SISO) equalization in frequency selective multipleinput multiple-output (MIMO) channels based on the well-known belief propagation (BP) algorithm. As in the BP equalizer, we model the multipath channels using factor graphs (FGs) where the transmitted and received signals are represented by the function and variable nodes respectively. The edges connecting the function and variable nodes illustrate the dependencies of the multipath channel and soft decisions are developed by exchanging information on these edges iteratively. We incorporate powerful techniques such as groupwise iterative multiuser detection (IMUD), probabilistic data association (PDA) and sphere decoding (SD) in order to reduce the computational complexity of BP equalizer with relatively small degradation in performance. The computational complexity of this new reduced-complexity BP (RCBP) equalizer grows linearly with block size and memory length of the channel. The proposed framework has a flexible structure that allows for parallel as well as serial detection. We will illustrate through simulations that the RCBP equalizer can even handle overloaded scenarios where the channel matrix is rank deficient, and it can achieve excellent performance by applying iterative equalization using the low-density parity check codes (LDPC).
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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.002 | 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".