A new approach to the design of adaptive MIMO wireless communication systems
Bibliographic record
Abstract
Since the capabilities of MIMO systems were discovered, much research effort has been invested in this field. However, in most applications, the channel state information (CSI) is assumed to be known to the receiver only. To further improve the performance, the transmission rate will adapt to the levels of CSI fed back from the receiver. The capacity and performance of linear dispersion code (LDC) are studied. An analytical expression of the ergodic capacity and a tight upper bound of the pairwise error probability of full-rate LDC are derived. The tight upper bound demonstrates the relationship between the pairwise error probability, the constellation size and the space-time (ST) symbol rate, which will be a guideline for the adaptation. The probability density function of the signal-to-interference-noise ratio (SINR) of a MIMO transceiver using LDC and linear minimum-mean-square-error (MMSE) receiver is then derived, over a Rayleigh fading channel. With these theoretical results as a guideline, we study the design of adaptive systems with discrete selection modes. An adaptive algorithm for the selection-mode adaptation is proposed. Based on the proposed algorithm, two adaptation techniques are presented, using constellation size and ST symbol rate, respectively. To improve the average transmission rate, a new adaptation design is developed, which is based on joint constellation size and ST symbol rate adaptation. Next, we propose a novel scheme called "beam-nulling" for MIMO adaptation. In the beam-nulling scheme, the eigenvector of the weakest subchannel is fed back and then signals are sent over a generated subspace orthogonal to the weakest subchannel. Theoretical analysis and numerical results show that the capacity of beam-nulling is close to the optimal water-filling scheme at medium SNR. Additionally, the SINR of an MMSE receiver is derived for beam-nulling, followed by a presentation of the associated numerical average bit-error rate (BER) of beam-nulling. Finally, to further improve the performance, beam-nulling is concatenated with LDC. Simulation results show that the concatenated beam-nulling schemes outperform the beamforming scheme at higher rate. Additionally, the existing beamforming and new proposed beam-nulling schemes can be extended if more than one eigenvector is available at the transmitter. Theoretical analysis and simulation results are also provided to evaluate the new extended schemes.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| 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.002 | 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".