Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and 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 158 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 106 tok/s Pro
Kimi K2 183 tok/s Pro
GPT OSS 120B 434 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Sub-optimality of Treating Interference as Noise in the Cellular Uplink (1105.5072v2)

Published 25 May 2011 in cs.IT and math.IT

Abstract: Despite the simplicity of the scheme of treating interference as noise (TIN), it was shown to be sum-capacity optimal in the Gaussian 2-user interference channel in \cite{ShangKramerChen,MotahariKhandani,AnnapureddyVeeravalli}. In this paper, an interference network consisting of a point-to-point channel interfering with a multiple access channel (MAC) is considered, with focus on the weak interference scenario. Naive TIN in this network is performed by using Gaussian codes at the transmitters, joint decoding at the MAC receiver while treating interference as noise, and single user decoding at the point-to-point receiver while treating both interferers as noise. It is shown that this naive TIN scheme is never optimal in this scenario. In fact, a scheme that combines both time division multiple access and TIN outperforms the naive TIN scheme. An upper bound on the sum-capacity of the given network is also derived.

Citations (5)

Summary

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

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

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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