Impulsive Noise Recovery and Elimination: A Sparse Machine Learning Based Approach
Bibliographic record
Abstract
The performance of orthogonal frequency division multiplexing (OFDM) based wireless vehicular communication systems is faced with the great challenge of impulsive noise (IN), which could limit the application of OFDM in ultra-reliable low-latency communication scenarios. In this paper, the challenge of IN elimination for OFDM-based wireless systems is efficiently overcome by the proposed sparse learning algorithms and probabilistic framework inspired by the emerging machine learning theories. For the first time, the sparse machine learning theory is introduced to IN recovery and elimination. Exploiting the measurement vector of IN observed from the reserved null sub-carriers as the input, a novel sparse machine learning based algorithm of sparse cross-entropy minimization is proposed, in which the probability distribution of the IN support is iteratively updated by minimizing the loss function, i.e. the cross-entropy. The proposed algorithm is able to effectively and efficiently learn the sparse pattern and converge to the accurate distribution of IN support. To facilitate an accelerated and even more efficient learning process, regularization is imposed on the loss function by adding a weighting parameter in favor of the accurate distribution. The computer simulation results confirm that the proposed scheme outperforms conventional methods while utilizing fewer spectrum resources over wireless vehicular channels.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 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.001 | 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".