Autoencoder-bank Based Design for Adaptive Channel-Blind Robust Transmission
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
Abstract The idea of employing deep autoencoders (AEs) has been recently proposed to capture the end-to-end performance in the physical layer of communication systems. However, most of the current methods for applying AEs are developed based on the assumption that there is an explicit channel model for training that matches the actual channel model in the online transmission. Since the actual channel varies over time, this imposes a major limitation on employing AE-based systems. In this paper, without relying on an explicit channel model, we propose an adaptive scheme to increase the reliability of an AE-based communication system over different channel conditions. More precisely, we divide the interval of random channel coefficients into n sub-intervals. Subsequently, in the offline training phase, we employ an AE bank consisting of n pairs of encoder and decoder and perform training over the sub-intervals. Then, in the online transmission phase, based on the actual channel conditions, the optimal pair of encoder and decoder is selected for data transmission in terms of satisfying an average block error rate (BLER) constraint imposed on the system. To monitor actual channel conditions for adopting the adaptive scheme, we assume a realistic scenario where the instantaneous channel gain is not known to Tx/Rx and it is blindly estimated at the RX, i.e., without using any pilot symbols. Our simulation results confirms the superiority of the proposed adaptive scheme over a non-adaptive scenario in terms of average power consumption. For instance, when the target average BLER is equal to 10 −4 , our proposed algorithm with n = 5 can achieve a performance gain over 1.2 dB compared with a non-adaptive scheme
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.003 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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