Loading…

To Decode the Interference or to Consider It as Noise

In this paper, the impact of noncoordinated interfering signals on a point to point communication is addressed. While the transmitter has no information about the other users' messages, the receiver has full knowledge of the codebooks of the interfering users and can potentially decode some par...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2011-03, Vol.57 (3), p.1274-1283
Main Authors: Motahari, A S, Khandani, A K
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c394t-39789d7e0a75e7ef018d1af2fd3ddcc6397d1c0ba241414fa1251d7bb91fe28f3
cites cdi_FETCH-LOGICAL-c394t-39789d7e0a75e7ef018d1af2fd3ddcc6397d1c0ba241414fa1251d7bb91fe28f3
container_end_page 1283
container_issue 3
container_start_page 1274
container_title IEEE transactions on information theory
container_volume 57
creator Motahari, A S
Khandani, A K
description In this paper, the impact of noncoordinated interfering signals on a point to point communication is addressed. While the transmitter has no information about the other users' messages, the receiver has full knowledge of the codebooks of the interfering users and can potentially decode some part of the interference. A simple coding strategy is proposed for this channel. Assuming its own data is decoded successfully, the receiver partitions the set of interfering users into two disjoint subsets, namely the set of decodable users and the set of nondecodable users. Then the transmitter's rate is chosen such that the intended signal can be jointly decoded with the set of decodable users. It is proved that the proposed strategy achieves the capacity of the additive Gaussian channel with Gaussian interfering users. A polynomial time algorithm is proposed to compute the achievable rate of the scheme. This algorithm is based a subroutine which separates the set of interfering users into decodable and nondecodable users in polynomial time. The proposed scheme is also applied to the case of -user interference channel and some achievable points are characterized by successive maximization of users' rates.
doi_str_mv 10.1109/TIT.2010.2103756
format article
fullrecord <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_proquest_journals_858943620</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5714251</ieee_id><sourcerecordid>864397871</sourcerecordid><originalsourceid>FETCH-LOGICAL-c394t-39789d7e0a75e7ef018d1af2fd3ddcc6397d1c0ba241414fa1251d7bb91fe28f3</originalsourceid><addsrcrecordid>eNpdkE1LAzEQhoMoWKt3wUsQxNPWfG42R6lfhaKXeg5pMsEt201Ntgf_vVlaPMgchmGeeWfmReiakhmlRD-sFqsZI6VilHAl6xM0oVKqStdSnKIJIbSptBDNObrIeVNKISmbILmK-Alc9ICHL8CLfoAUIEHvAMeEh4jnsc-th4QXA7YZv8c2wyU6C7bLcHXMU_T58ryav1XLj9fF_HFZOa7FUHGtGu0VEKskKAjlBk9tYMFz752rS99TR9aWCVoiWMok9Wq91jQAawKfovuD7i7F7z3kwWzb7KDrbA9xn01Ti3GHooW8_Udu4j715TjTyEYLXjNSIHKAXIo5Jwhml9qtTT-GEjO6aIqLZnTRHF0sI3dHXZud7UKyvWvz3xzjmjecjNI3B64FgL-2VFSUl_gvl8p4Ug</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>858943620</pqid></control><display><type>article</type><title>To Decode the Interference or to Consider It as Noise</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Motahari, A S ; Khandani, A K</creator><creatorcontrib>Motahari, A S ; Khandani, A K</creatorcontrib><description>In this paper, the impact of noncoordinated interfering signals on a point to point communication is addressed. While the transmitter has no information about the other users' messages, the receiver has full knowledge of the codebooks of the interfering users and can potentially decode some part of the interference. A simple coding strategy is proposed for this channel. Assuming its own data is decoded successfully, the receiver partitions the set of interfering users into two disjoint subsets, namely the set of decodable users and the set of nondecodable users. Then the transmitter's rate is chosen such that the intended signal can be jointly decoded with the set of decodable users. It is proved that the proposed strategy achieves the capacity of the additive Gaussian channel with Gaussian interfering users. A polynomial time algorithm is proposed to compute the achievable rate of the scheme. This algorithm is based a subroutine which separates the set of interfering users into decodable and nondecodable users in polynomial time. The proposed scheme is also applied to the case of -user interference channel and some achievable points are characterized by successive maximization of users' rates.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2010.2103756</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Additives ; Algorithms ; Applied sciences ; Capacity region ; Channels ; Coding, codes ; combinatorial optimization ; Communication ; Decoding ; Electric noise ; Exact sciences and technology ; Gaussian ; Information ; Information theory ; Information, signal and communications theory ; Interference ; interference channel ; Knowledge ; Maximization ; Noise ; Normal distribution ; Radiocommunications ; Random variables ; Receivers ; Signal and communications theory ; Strategy ; submodular functions ; Telecommunications ; Telecommunications and information theory ; Transmitters ; Transmitters. Receivers ; Users</subject><ispartof>IEEE transactions on information theory, 2011-03, Vol.57 (3), p.1274-1283</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2011</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c394t-39789d7e0a75e7ef018d1af2fd3ddcc6397d1c0ba241414fa1251d7bb91fe28f3</citedby><cites>FETCH-LOGICAL-c394t-39789d7e0a75e7ef018d1af2fd3ddcc6397d1c0ba241414fa1251d7bb91fe28f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5714251$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=23938300$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Motahari, A S</creatorcontrib><creatorcontrib>Khandani, A K</creatorcontrib><title>To Decode the Interference or to Consider It as Noise</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>In this paper, the impact of noncoordinated interfering signals on a point to point communication is addressed. While the transmitter has no information about the other users' messages, the receiver has full knowledge of the codebooks of the interfering users and can potentially decode some part of the interference. A simple coding strategy is proposed for this channel. Assuming its own data is decoded successfully, the receiver partitions the set of interfering users into two disjoint subsets, namely the set of decodable users and the set of nondecodable users. Then the transmitter's rate is chosen such that the intended signal can be jointly decoded with the set of decodable users. It is proved that the proposed strategy achieves the capacity of the additive Gaussian channel with Gaussian interfering users. A polynomial time algorithm is proposed to compute the achievable rate of the scheme. This algorithm is based a subroutine which separates the set of interfering users into decodable and nondecodable users in polynomial time. The proposed scheme is also applied to the case of -user interference channel and some achievable points are characterized by successive maximization of users' rates.</description><subject>Additives</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Capacity region</subject><subject>Channels</subject><subject>Coding, codes</subject><subject>combinatorial optimization</subject><subject>Communication</subject><subject>Decoding</subject><subject>Electric noise</subject><subject>Exact sciences and technology</subject><subject>Gaussian</subject><subject>Information</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Interference</subject><subject>interference channel</subject><subject>Knowledge</subject><subject>Maximization</subject><subject>Noise</subject><subject>Normal distribution</subject><subject>Radiocommunications</subject><subject>Random variables</subject><subject>Receivers</subject><subject>Signal and communications theory</subject><subject>Strategy</subject><subject>submodular functions</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmitters</subject><subject>Transmitters. Receivers</subject><subject>Users</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNpdkE1LAzEQhoMoWKt3wUsQxNPWfG42R6lfhaKXeg5pMsEt201Ntgf_vVlaPMgchmGeeWfmReiakhmlRD-sFqsZI6VilHAl6xM0oVKqStdSnKIJIbSptBDNObrIeVNKISmbILmK-Alc9ICHL8CLfoAUIEHvAMeEh4jnsc-th4QXA7YZv8c2wyU6C7bLcHXMU_T58ryav1XLj9fF_HFZOa7FUHGtGu0VEKskKAjlBk9tYMFz752rS99TR9aWCVoiWMok9Wq91jQAawKfovuD7i7F7z3kwWzb7KDrbA9xn01Ti3GHooW8_Udu4j715TjTyEYLXjNSIHKAXIo5Jwhml9qtTT-GEjO6aIqLZnTRHF0sI3dHXZud7UKyvWvz3xzjmjecjNI3B64FgL-2VFSUl_gvl8p4Ug</recordid><startdate>20110301</startdate><enddate>20110301</enddate><creator>Motahari, A S</creator><creator>Khandani, A K</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20110301</creationdate><title>To Decode the Interference or to Consider It as Noise</title><author>Motahari, A S ; Khandani, A K</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c394t-39789d7e0a75e7ef018d1af2fd3ddcc6397d1c0ba241414fa1251d7bb91fe28f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Additives</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Capacity region</topic><topic>Channels</topic><topic>Coding, codes</topic><topic>combinatorial optimization</topic><topic>Communication</topic><topic>Decoding</topic><topic>Electric noise</topic><topic>Exact sciences and technology</topic><topic>Gaussian</topic><topic>Information</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Interference</topic><topic>interference channel</topic><topic>Knowledge</topic><topic>Maximization</topic><topic>Noise</topic><topic>Normal distribution</topic><topic>Radiocommunications</topic><topic>Random variables</topic><topic>Receivers</topic><topic>Signal and communications theory</topic><topic>Strategy</topic><topic>submodular functions</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmitters</topic><topic>Transmitters. Receivers</topic><topic>Users</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Motahari, A S</creatorcontrib><creatorcontrib>Khandani, A K</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library Online</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Motahari, A S</au><au>Khandani, A K</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>To Decode the Interference or to Consider It as Noise</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2011-03-01</date><risdate>2011</risdate><volume>57</volume><issue>3</issue><spage>1274</spage><epage>1283</epage><pages>1274-1283</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>In this paper, the impact of noncoordinated interfering signals on a point to point communication is addressed. While the transmitter has no information about the other users' messages, the receiver has full knowledge of the codebooks of the interfering users and can potentially decode some part of the interference. A simple coding strategy is proposed for this channel. Assuming its own data is decoded successfully, the receiver partitions the set of interfering users into two disjoint subsets, namely the set of decodable users and the set of nondecodable users. Then the transmitter's rate is chosen such that the intended signal can be jointly decoded with the set of decodable users. It is proved that the proposed strategy achieves the capacity of the additive Gaussian channel with Gaussian interfering users. A polynomial time algorithm is proposed to compute the achievable rate of the scheme. This algorithm is based a subroutine which separates the set of interfering users into decodable and nondecodable users in polynomial time. The proposed scheme is also applied to the case of -user interference channel and some achievable points are characterized by successive maximization of users' rates.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2010.2103756</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0018-9448
ispartof IEEE transactions on information theory, 2011-03, Vol.57 (3), p.1274-1283
issn 0018-9448
1557-9654
language eng
recordid cdi_proquest_journals_858943620
source IEEE Electronic Library (IEL) Journals
subjects Additives
Algorithms
Applied sciences
Capacity region
Channels
Coding, codes
combinatorial optimization
Communication
Decoding
Electric noise
Exact sciences and technology
Gaussian
Information
Information theory
Information, signal and communications theory
Interference
interference channel
Knowledge
Maximization
Noise
Normal distribution
Radiocommunications
Random variables
Receivers
Signal and communications theory
Strategy
submodular functions
Telecommunications
Telecommunications and information theory
Transmitters
Transmitters. Receivers
Users
title To Decode the Interference or to Consider It as Noise
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T21%3A25%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=To%20Decode%20the%20Interference%20or%20to%20Consider%20It%20as%20Noise&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Motahari,%20A%20S&rft.date=2011-03-01&rft.volume=57&rft.issue=3&rft.spage=1274&rft.epage=1283&rft.pages=1274-1283&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2010.2103756&rft_dat=%3Cproquest_pasca%3E864397871%3C/proquest_pasca%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c394t-39789d7e0a75e7ef018d1af2fd3ddcc6397d1c0ba241414fa1251d7bb91fe28f3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=858943620&rft_id=info:pmid/&rft_ieee_id=5714251&rfr_iscdi=true