Machine Learning-Inspired Hybrid Precoding for HAP Massive MIMO Systems with Limited RF Chains
Bibliographic record
Abstract
Energy efficiency (EE) is the main target of wireless communication nowadays. In this paper, we investigate hybrid precoding (HP) and massive multiple-input multiple-output (MIMO) systems for a high-altitude platform (HAP). The HAP is an emerging solution operating in the stratosphere at an amplitude of up to 20–40 km to provide communication facilities that can achieve the best features of both terrestrial and satellite systems. The existing hybrid beamforming solution on a HAP requires a large number of high-resolution phase shifters (PSs) to realize analog beamforming and radio frequency (RF) chains associated with each antenna and achieve better performance. This leads to enormous power consumption, high costs, and high hardware complexity. To address such issues, one possible solution that has to be tweaked is to minimize the number of PSs and RFs or reduce their power consumption. This study proposes an HP sub-connected low-resolution bit PSs to address these challenges while lowering overall power consumption and achieving EE. To significantly reduce the RF chain in a massive MIMO system, HP is a suitable solution. This study further examined adaptive cross-entropy (ACE), a machine learning-based optimization that optimizes the achievable sum rate and energy efficiency in the Rician fading channel for HAP massive MIMO systems. ACE randomly generates several candidate solutions according to the probability distribution (PD) of the elements in HP. According to their sum rate, it adaptively weights these candidates’ HP and improves the PD in HP systems by minimizing the cross-entropy. Furthermore, this work suggests energy consumption analysis performance evaluation to unveil the fact that the proposed technique based on a sub-connected low-bit PS architecture can achieve near-optimum EE and sum rates compared with the previously reported methods.
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.000 |
| 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".