2017/01/18 by Abhiram Gnanasambandam, Gnanasambandam, Abhiram, Ragini Chaluvadi +3
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1701.04971
openalex publication_date 2017/01/18 · arxiv created 2017/05/03 · arxiv updated 2017/05/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We obtain new sum capacity results for the Gaussian many-to-one and one-to-many interference channels in channel parameter regimes where the sum capacity was known only up to a constant gap. Simple Han-Kobayashi (HK) schemes, i.e., HK schemes with Gaussian signaling, no time-sharing, and no common-private power splitting, achieve sum capacity under the channel conditions for which the new results are obtained. To obtain sum capacity results, we show that genie-aided upper bounds match the achievable sum rate of simple HK schemes under certain channel conditions.