How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Real and complex two-user Gaussian interference channels
Definition
The two-user Gaussian interference channel has independent messages, separate encoders, and outputs For the real model, are real and . For the complex model, the inputs and gains are complex and with density . The receiver-noise variables are independent across receivers and channel uses and independent of the messages, so the channel is memoryless. Each power budget satisfies . A length- code has independent uniform messages on for integers , deterministic separate encoders , and decoders ; no feedback is present. The expected average-power constraints are in the real model and in the complex model, with expectations under the uniform message law. The average joint error is . For either model define Rates are bits per use, . For a scalar unit-noise AWGN link with power constraint , the capacity is , attained by a centered real Gaussian input or a circular complex Gaussian input; in the real model and in the complex model.
Used by
- A numerical asymmetric Gaussian channel in the strong regime Example
- Entropy estimates for complex Gaussian interference converses Lemma
- Gaussian Han-Kobayashi inner region for a fixed private-power split Lemma
- Gaussian superposition Han–Kobayashi region with nonunique decoding and rate moving Lemma
- Genie-aided outer bounds for the two-user Gaussian interference channel Lemma
- Random coding achieves the finite-dimensional Gaussian multiple-access region Lemma
- Exact strong-interference region for the two-user Gaussian interference channel Theorem
- The two-user Gaussian interference capacity region to within one bit Theorem
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Raul H. Etkin, David N. C. Tse, and Hua Wang, Gaussian Interference Channel Capacity to Within One Bit, IEEE Transactions on Information Theory 54(12), 2008 (standard reference, not scraped)
- Abbas El Gamal and Young-Han Kim, Lecture Notes on Network Information Theory, arXiv:1001.3404v4 (standard reference, not scraped)