Autoencoder-based Spatial Modulation for the Next Generation of Wireless Networks
Bibliographic record
Abstract
Spatial Modulation (SM) has been proposed as a multiple-input-multiple-output (MIMO)-based technique to overcome the inter-channel interference experienced in conventional MIMO systems. It has been further shown that SM enhances energy efficiency and reduces the receiver’s complexity. Nevertheless, under high antenna correlation scenarios, the detection performance of the antenna indices degrades significantly. To address this critical concern, in this paper, we propose three autoencoder-based frameworks for spatial modulation. The first scenario, similar to conventional spatial modulation, trains the encoder for data modulation and the decoder for data demodulation as well as antenna index detection. The performance of this framework deteriorates in high antenna correlation scenarios. Therefore, two novel solutions are presented to embed the antenna index into the transmitted signal in order to reduce the receiver’s reliance on the channel conditions. The first framework adds a phase-shift keying-based antenna signature, while the other trains the encoder to learn an appropriate antenna index embedding. Simulation results show that the two enhanced frameworks result in a significantly enhanced performance, compared to conventional spatial modulation, in terms of block error rate and power efficiency under a high correlation setup (about 18 dB and 24 dB gain, respectively, at a Rician factor of 20 dB).
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.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.001 |
| Open science | 0.000 | 0.000 |
| 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".