2000 character limit reached
On Gaussian Multiple Access Channels with Interference: Achievable Rates and Upper Bounds
Published 13 Mar 2011 in cs.IT and math.IT | (1103.2501v1)
Abstract: We study the interaction between two interfering Gaussian 2-user multiple access channels. The capacity region is characterized under mixed strong--extremely strong interference and individually very strong interference. Furthermore, the sum capacity is derived under a less restricting definition of very strong interference. Finally, a general upper bound on the sum capacity is provided, which is nearly tight for weak cross links.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.