Capacity Bounds for the $K$-User Gaussian Interference Channel

The capacity region of the $K$-user Gaussian interference channel (GIC) is a long-standing open problem and even capacity outer bounds are little known in general. A significant progress on degrees-of-freedom (DoF) analysis, a first-order capacity approximation, for the $K$-user GIC has provided new...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Nam, Junyoung
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Nam, Junyoung
description The capacity region of the $K$-user Gaussian interference channel (GIC) is a long-standing open problem and even capacity outer bounds are little known in general. A significant progress on degrees-of-freedom (DoF) analysis, a first-order capacity approximation, for the $K$-user GIC has provided new important insights into the problem of interest in the high signal-to-noise ratio (SNR) limit. However, such capacity approximation has been observed to have some limitations in predicting the capacity at \emph{finite} SNR. In this work, we develop a new upper-bounding technique that utilizes a new type of genie signal and applies \emph{time sharing} to genie signals at $K$ receivers. Based on this technique, we derive new upper bounds on the sum capacity of the three-user GIC with constant, complex channel coefficients and then generalize to the $K$-user case to better understand sum-rate behavior at finite SNR. We also provide closed-form expressions of our upper bounds on the capacity of the $K$-user symmetric GIC easily computable for \emph{any} $K$. From the perspectives of our results, some sum-rate behavior at finite SNR is in line with the insights given by the known DoF results, while some others are not. In particular, the well-known $K/2$ DoF achievable for almost all constant real channel coefficients turns out to be not embodied as a substantial performance gain over a certain range of the cross-channel coefficient in the $K$-user symmetric real case especially for \emph{large} $K$. We further investigate the impact of phase offset between the direct-channel coefficient and the cross-channel coefficients on the sum-rate upper bound for the three-user \emph{complex} GIC. As a consequence, we aim to provide new findings that could not be predicted by the prior works on DoF of GICs.
doi_str_mv 10.48550/arxiv.1506.03319
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1506_03319</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1506_03319</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-4a674efd080cdf8a7ea31f1aab026284bde60f028358c96fb0f526e3d27a616c3</originalsourceid><addsrcrecordid>eNotz7FuwjAUhWEvHSrgATrVA2vSazt2nKVSG7UUFakLzNGNfS0iUYPsgMrbF2iX829H-hh7EFBWVmt4wvQznEqhwZSglGju2XOLB3TDeOav-2P0mYd94uOW-PxzXmwyJb7AY84DRr6MI6VAiaIj3m4xRtpN2V3AXabZfyds_f62bj-K1ddi2b6sCjR1U1SXrSh4sOB8sFgTKhEEYg_SSFv1ngwEkFZp6xoTeghaGlJe1miEcWrCHv9ub4DukIZvTOfuCuluEPUL2XVCRw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Capacity Bounds for the $K$-User Gaussian Interference Channel</title><source>arXiv.org</source><creator>Nam, Junyoung</creator><creatorcontrib>Nam, Junyoung</creatorcontrib><description>The capacity region of the $K$-user Gaussian interference channel (GIC) is a long-standing open problem and even capacity outer bounds are little known in general. A significant progress on degrees-of-freedom (DoF) analysis, a first-order capacity approximation, for the $K$-user GIC has provided new important insights into the problem of interest in the high signal-to-noise ratio (SNR) limit. However, such capacity approximation has been observed to have some limitations in predicting the capacity at \emph{finite} SNR. In this work, we develop a new upper-bounding technique that utilizes a new type of genie signal and applies \emph{time sharing} to genie signals at $K$ receivers. Based on this technique, we derive new upper bounds on the sum capacity of the three-user GIC with constant, complex channel coefficients and then generalize to the $K$-user case to better understand sum-rate behavior at finite SNR. We also provide closed-form expressions of our upper bounds on the capacity of the $K$-user symmetric GIC easily computable for \emph{any} $K$. From the perspectives of our results, some sum-rate behavior at finite SNR is in line with the insights given by the known DoF results, while some others are not. In particular, the well-known $K/2$ DoF achievable for almost all constant real channel coefficients turns out to be not embodied as a substantial performance gain over a certain range of the cross-channel coefficient in the $K$-user symmetric real case especially for \emph{large} $K$. We further investigate the impact of phase offset between the direct-channel coefficient and the cross-channel coefficients on the sum-rate upper bound for the three-user \emph{complex} GIC. As a consequence, we aim to provide new findings that could not be predicted by the prior works on DoF of GICs.</description><identifier>DOI: 10.48550/arxiv.1506.03319</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2015-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1506.03319$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1506.03319$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Nam, Junyoung</creatorcontrib><title>Capacity Bounds for the $K$-User Gaussian Interference Channel</title><description>The capacity region of the $K$-user Gaussian interference channel (GIC) is a long-standing open problem and even capacity outer bounds are little known in general. A significant progress on degrees-of-freedom (DoF) analysis, a first-order capacity approximation, for the $K$-user GIC has provided new important insights into the problem of interest in the high signal-to-noise ratio (SNR) limit. However, such capacity approximation has been observed to have some limitations in predicting the capacity at \emph{finite} SNR. In this work, we develop a new upper-bounding technique that utilizes a new type of genie signal and applies \emph{time sharing} to genie signals at $K$ receivers. Based on this technique, we derive new upper bounds on the sum capacity of the three-user GIC with constant, complex channel coefficients and then generalize to the $K$-user case to better understand sum-rate behavior at finite SNR. We also provide closed-form expressions of our upper bounds on the capacity of the $K$-user symmetric GIC easily computable for \emph{any} $K$. From the perspectives of our results, some sum-rate behavior at finite SNR is in line with the insights given by the known DoF results, while some others are not. In particular, the well-known $K/2$ DoF achievable for almost all constant real channel coefficients turns out to be not embodied as a substantial performance gain over a certain range of the cross-channel coefficient in the $K$-user symmetric real case especially for \emph{large} $K$. We further investigate the impact of phase offset between the direct-channel coefficient and the cross-channel coefficients on the sum-rate upper bound for the three-user \emph{complex} GIC. As a consequence, we aim to provide new findings that could not be predicted by the prior works on DoF of GICs.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz7FuwjAUhWEvHSrgATrVA2vSazt2nKVSG7UUFakLzNGNfS0iUYPsgMrbF2iX829H-hh7EFBWVmt4wvQznEqhwZSglGju2XOLB3TDeOav-2P0mYd94uOW-PxzXmwyJb7AY84DRr6MI6VAiaIj3m4xRtpN2V3AXabZfyds_f62bj-K1ddi2b6sCjR1U1SXrSh4sOB8sFgTKhEEYg_SSFv1ngwEkFZp6xoTeghaGlJe1miEcWrCHv9ub4DukIZvTOfuCuluEPUL2XVCRw</recordid><startdate>20150610</startdate><enddate>20150610</enddate><creator>Nam, Junyoung</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20150610</creationdate><title>Capacity Bounds for the $K$-User Gaussian Interference Channel</title><author>Nam, Junyoung</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-4a674efd080cdf8a7ea31f1aab026284bde60f028358c96fb0f526e3d27a616c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Nam, Junyoung</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Nam, Junyoung</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Capacity Bounds for the $K$-User Gaussian Interference Channel</atitle><date>2015-06-10</date><risdate>2015</risdate><abstract>The capacity region of the $K$-user Gaussian interference channel (GIC) is a long-standing open problem and even capacity outer bounds are little known in general. A significant progress on degrees-of-freedom (DoF) analysis, a first-order capacity approximation, for the $K$-user GIC has provided new important insights into the problem of interest in the high signal-to-noise ratio (SNR) limit. However, such capacity approximation has been observed to have some limitations in predicting the capacity at \emph{finite} SNR. In this work, we develop a new upper-bounding technique that utilizes a new type of genie signal and applies \emph{time sharing} to genie signals at $K$ receivers. Based on this technique, we derive new upper bounds on the sum capacity of the three-user GIC with constant, complex channel coefficients and then generalize to the $K$-user case to better understand sum-rate behavior at finite SNR. We also provide closed-form expressions of our upper bounds on the capacity of the $K$-user symmetric GIC easily computable for \emph{any} $K$. From the perspectives of our results, some sum-rate behavior at finite SNR is in line with the insights given by the known DoF results, while some others are not. In particular, the well-known $K/2$ DoF achievable for almost all constant real channel coefficients turns out to be not embodied as a substantial performance gain over a certain range of the cross-channel coefficient in the $K$-user symmetric real case especially for \emph{large} $K$. We further investigate the impact of phase offset between the direct-channel coefficient and the cross-channel coefficients on the sum-rate upper bound for the three-user \emph{complex} GIC. As a consequence, we aim to provide new findings that could not be predicted by the prior works on DoF of GICs.</abstract><doi>10.48550/arxiv.1506.03319</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1506.03319
ispartof
issn
language eng
recordid cdi_arxiv_primary_1506_03319
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Information Theory
title Capacity Bounds for the $K$-User Gaussian Interference Channel
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T03%3A21%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Capacity%20Bounds%20for%20the%20$K$-User%20Gaussian%20Interference%20Channel&rft.au=Nam,%20Junyoung&rft.date=2015-06-10&rft_id=info:doi/10.48550/arxiv.1506.03319&rft_dat=%3Carxiv_GOX%3E1506_03319%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true