Adaptive L<sub>p</sub>-norm diversity combining in non-gaussian noise and interference
Bibliographic record
Abstract
In this paper, we introduce an adaptive Lp-norm metric for robust coherent, differential, and noncoherent diversity combining in non-Gaussian noise and interference. We consider the general case where all diversity branches may use different combining weights and different Lp-norms. We derive a general closed-form expression for the asymptotic bit error rate (BER) for Lp-norm combining in independent non-identically distributed Ricean fading and non-Gaussian noise and interference with finite moments. The asymptotic BER expression reveals that the diversity gain of Lp-norm combining is independent of the type of noise and the metric parameters. In contrast, the combining gain depends on both the type of noise and the metric parameters. Thus, the asymptotic BER can be minimized by optimizing the Lp-norm metric parameters for the underlying type of noise. For this purpose finite difference stochastic approximation (FDSA) and localized random search (LRS) algorithms are developed. Both adaptive algorithms do not require any a priori knowledge about the underlying noise and are able to track changes in the noise statistics. Simulation results confirm the validity of the derived asymptotic BER expressions, the effectiveness of the proposed adaptive algorithms, and the excellent performance of the proposed adaptive Lp-norm metric compared to other popular metrics.
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.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.001 | 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".