An Improved Nonlinear Precoding Scheme in Multicarrier Signaling Optimization for Transportation Networks Applications
Bibliographic record
Abstract
The digitalization of traffic networks has spurred the development of intelligent transportation systems. By utilizing reinforcement learning for dynamic traffic optimization, it efficiently handles real-world traffic complexities. However, as the demand for real-time, high-efficiency tasks increases, relying solely on reinforcement learning struggles to meet both goals. Integrating reinforcement learning with mobile communication technology offers a promising solution for efficient, low-overhead traffic networks. As an important physical layer technology for Integrated Sensing and Communications Systems, Spectrally Efficient Frequency Division Multiplexing (SEFDM) addresses the communication overhead challenge in reinforcement learning-enabled optimization. However, the main challenge of SEFDM is eliminating the inter-carrier interference (ICI) caused by non-orthogonal modulation. Considering that existing post-interference cancellation methods fail due to the ill-conditioning of the generalized channel matrix, which cannot be directly inverted, we propose a nonlinear precoding algorithm at the transmitter, instead of post-cancellation, that effectively eliminates interference and improves transmission reliability. We firstly use a nonlinear feedback structure to avoid power boost and error propagation. Besides that, Geometric Mean Decomposition (GMD) based interference matrix decomposition algorithm is used in the proposed precoding scheme to avoid matrix singularity and obtain diversity gain. Finally, the numerical results show that the proposed precoding method can achieve higher order QAM SEFDM signaling with higher spectral efficiency and get comparative BER performance.
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.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.000 | 0.000 |
| Research integrity | 0.000 | 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".