Capacity of Bernoulli-Gaussian Interference Channels in Rayleigh Fading with Full CSI
Bibliographic record
Abstract
In this paper, we investigate the channel capacity of a Bernoulli-Gaussian (BG) interference channel in Rayleigh fading when the channel state information (CSI) is known at both the transmitter and receiver via tight lower and upper bounds. Specifically, we first derive an upper bound on the channel capacity assuming a Gaussian-distributed output. Under this assumption, an optimal power adaptation scheme is established and the upper-bound is obtained in closed-form. By assuming a Gaussian-distributed input, we then adopt the derived power adaptation scheme to establish a lower bound on channel capacity. A simple approximation of the instantaneous output entropy using a piecewise-linear curve fitting(PWLCF)-based scheme is then developed, which provides a closed-form estimation of the lower bound with a predetermined error level. Finally, a comparison between the derived upper and lower bounds are made. Both analytical and numerical results show that these two bounds are tight in a wide range of input power levels and they can be used effectively to estimate the channel capacity.
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.002 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| 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".