Minimum-selection maximum ratio transmission schemes in underlay cognitive radio systems
Bibliographic record
Abstract
Under the scenario of an underlay cognitive radio network, we introduce the concept of minimum-selection maximum ratio transmission (MS-MRT). Inspired by the mode of operation of the minimum-selection generalized selection combining (MS-GSC) technique, the main idea behind MS-MRT is to present an adaptive variation of the existing maximum ratio transmission (MRT) technique. While in the MRT scheme, all the transmit antennas are used for transmission, and only a subset of antennas verifying the interference constraint to the primary receiver in MS-MRT are adaptively selected and optimally beamformed in order to meet a given modulation requirement. The main goal of these schemes is to maximize the capacity of the secondary link while satisfying the bit error rate (BER) requirement and a peak interference constraint to the primary link. The performance of the proposed schemes is analyzed in terms of the average spectral efficiency, the average number of antennas used for transmission, the average delay, and the average BER performance. These results are then compared to the existing bandwidth efficient and switching efficient schemes (BES and SES, respectively). The obtained analytical results are then verified with selected numerical examples obtained via Monte-Carlo simulations. We demonstrate through these examples that the proposed schemes improve the spectral and the delay performance of the SES and BES schemes and fit better to delay sensitive applications. The proposed schemes also offer better processing-power consumption than the MRT schemes since a minimum number of antennas is used for communication in the MS-MRT schemes. The MS-MRT techniques represent power and spectral efficient schemes that can be extended to more practical scenarios. As an example, these schemes can be studied in the context of Long term Evolution (LTE) Networks where adaptive modulation, beamforming, and interference management are of the major enabling Techniques.
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 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.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.005 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.002 |
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 teacher head, 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".