Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 56 tok/s
Gemini 2.5 Pro 39 tok/s Pro
GPT-5 Medium 15 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 99 tok/s Pro
Kimi K2 155 tok/s Pro
GPT OSS 120B 476 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Optimal Point-to-Point Codes in Interference Channels: An Incremental I-MMSE approach (1510.08213v2)

Published 28 Oct 2015 in cs.IT and math.IT

Abstract: A recent result of the authors shows a so-called I-MMSE-like relationship that, for the two-user Gaussian interference channel, an I-MMSE relationship holds in the limit, as n $\to \infty$, between the interference and the interfered-with receiver, assuming that the interfered-with transmission is an optimal point-to-point sequence (achieves the point-to-point capacity). This result was further used to provide a proof of the "missing corner points" of the two-user Gaussian interference channel. This paper provides an information theoretic proof of the above-mentioned I-MMSE-like relationship which follows the incremental channel approach, an approach which was used by Guo, Shamai and Verd\'u to provide an insightful proof of the original I-MMSE relationship for point-to-point channels. Finally, some additional applications of this result are shown for other multi-user settings: the Gaussian multiple-access channel with interference and specific K-user Gaussian Z-interference channel settings.

Citations (3)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.