Fundamental Limits of Non-Coherent Interference Alignment via Matroid Theory
We consider the problem of non-coherent interference alignment, in which the goal is to align the signals of multiple interfering transmitters at a single receiver where the transmitters are not aware of the channel state information. We cast this problem as a problem of determining rank loss condit...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2017-10, Vol.63 (10), p.6573-6586 |
|---|---|
| Hauptverfasser: | , , |
| 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 | 6586 |
|---|---|
| container_issue | 10 |
| container_start_page | 6573 |
| container_title | IEEE transactions on information theory |
| container_volume | 63 |
| creator | Naderializadeh, Navid El Gamal, Aly Avestimehr, A. Salman |
| description | We consider the problem of non-coherent interference alignment, in which the goal is to align the signals of multiple interfering transmitters at a single receiver where the transmitters are not aware of the channel state information. We cast this problem as a problem of determining rank loss conditions for a column concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient. We determine necessary and sufficient conditions for the design of each matrix, such that the random ensemble will almost surely lose rank by a certain amount. The result is proved by converting the problem to determining rank loss conditions for the union of some specific matroids, and then using tools from matroid and graph theories to derive the necessary and sufficient conditions. As an application, we discuss how this result can be applied to the problem of topological interference management, and characterize the linear symmetric degrees of freedom for a class of network topologies. |
| doi_str_mv | 10.1109/TIT.2017.2737010 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2174326333</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8003489</ieee_id><sourcerecordid>2174326333</sourcerecordid><originalsourceid>FETCH-LOGICAL-c333t-b92ec8d423a6ebee7d984e4a01201be9f51b3b86b25fafc4440032f622ae40ac3</originalsourceid><addsrcrecordid>eNo9kM1LAzEQxYMoWKt3wUvA89Z87W5yLMXWwqqX9RyyuxOb0m5qshX635ulxdPMML83j3kIPVIyo5Sol3pdzxih5YyVvCSUXKEJzfMyU0UurtGEECozJYS8RXcxbtMocsomqFoe-87soR_MDldu74aIvcUfvs8WfgMhLfC6HyDYsW8Bz3fuux95_OsMfjdD8K7D9QZ8ON2jG2t2ER4udYq-lq_14i2rPlfrxbzKWs75kDWKQSs7wbgpoAEoOyUFCENoeqABZXPa8EYWDcutsa0QghDObMGYAUFMy6fo-Xz3EPzPEeKgt_4Y-mSpGS0FZ0XySRQ5U23wMQaw-hDc3oSTpkSPmemUmR4z05fMkuTpLHEA8I_LZC-k4n-U1Gey</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2174326333</pqid></control><display><type>article</type><title>Fundamental Limits of Non-Coherent Interference Alignment via Matroid Theory</title><source>IEEE Electronic Library (IEL)</source><creator>Naderializadeh, Navid ; El Gamal, Aly ; Avestimehr, A. Salman</creator><creatorcontrib>Naderializadeh, Navid ; El Gamal, Aly ; Avestimehr, A. Salman</creatorcontrib><description>We consider the problem of non-coherent interference alignment, in which the goal is to align the signals of multiple interfering transmitters at a single receiver where the transmitters are not aware of the channel state information. We cast this problem as a problem of determining rank loss conditions for a column concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient. We determine necessary and sufficient conditions for the design of each matrix, such that the random ensemble will almost surely lose rank by a certain amount. The result is proved by converting the problem to determining rank loss conditions for the union of some specific matroids, and then using tools from matroid and graph theories to derive the necessary and sufficient conditions. As an application, we discuss how this result can be applied to the problem of topological interference management, and characterize the linear symmetric degrees of freedom for a class of network topologies.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2017.2737010</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Alignment ; Array signal processing ; degrees of freedom ; Interference ; interference cancellation ; matrices ; Matrices (mathematics) ; Matrix converters ; Network topologies ; Network topology ; rank loss ; Receivers ; Topology ; Transmitters</subject><ispartof>IEEE transactions on information theory, 2017-10, Vol.63 (10), p.6573-6586</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c333t-b92ec8d423a6ebee7d984e4a01201be9f51b3b86b25fafc4440032f622ae40ac3</citedby><cites>FETCH-LOGICAL-c333t-b92ec8d423a6ebee7d984e4a01201be9f51b3b86b25fafc4440032f622ae40ac3</cites><orcidid>0000-0002-0400-4506 ; 0000-0002-4891-6726</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8003489$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,778,782,794,27907,27908,54741</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8003489$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Naderializadeh, Navid</creatorcontrib><creatorcontrib>El Gamal, Aly</creatorcontrib><creatorcontrib>Avestimehr, A. Salman</creatorcontrib><title>Fundamental Limits of Non-Coherent Interference Alignment via Matroid Theory</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>We consider the problem of non-coherent interference alignment, in which the goal is to align the signals of multiple interfering transmitters at a single receiver where the transmitters are not aware of the channel state information. We cast this problem as a problem of determining rank loss conditions for a column concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient. We determine necessary and sufficient conditions for the design of each matrix, such that the random ensemble will almost surely lose rank by a certain amount. The result is proved by converting the problem to determining rank loss conditions for the union of some specific matroids, and then using tools from matroid and graph theories to derive the necessary and sufficient conditions. As an application, we discuss how this result can be applied to the problem of topological interference management, and characterize the linear symmetric degrees of freedom for a class of network topologies.</description><subject>Alignment</subject><subject>Array signal processing</subject><subject>degrees of freedom</subject><subject>Interference</subject><subject>interference cancellation</subject><subject>matrices</subject><subject>Matrices (mathematics)</subject><subject>Matrix converters</subject><subject>Network topologies</subject><subject>Network topology</subject><subject>rank loss</subject><subject>Receivers</subject><subject>Topology</subject><subject>Transmitters</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kM1LAzEQxYMoWKt3wUvA89Z87W5yLMXWwqqX9RyyuxOb0m5qshX635ulxdPMML83j3kIPVIyo5Sol3pdzxih5YyVvCSUXKEJzfMyU0UurtGEECozJYS8RXcxbtMocsomqFoe-87soR_MDldu74aIvcUfvs8WfgMhLfC6HyDYsW8Bz3fuux95_OsMfjdD8K7D9QZ8ON2jG2t2ER4udYq-lq_14i2rPlfrxbzKWs75kDWKQSs7wbgpoAEoOyUFCENoeqABZXPa8EYWDcutsa0QghDObMGYAUFMy6fo-Xz3EPzPEeKgt_4Y-mSpGS0FZ0XySRQ5U23wMQaw-hDc3oSTpkSPmemUmR4z05fMkuTpLHEA8I_LZC-k4n-U1Gey</recordid><startdate>20171001</startdate><enddate>20171001</enddate><creator>Naderializadeh, Navid</creator><creator>El Gamal, Aly</creator><creator>Avestimehr, A. Salman</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</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><orcidid>https://orcid.org/0000-0002-0400-4506</orcidid><orcidid>https://orcid.org/0000-0002-4891-6726</orcidid></search><sort><creationdate>20171001</creationdate><title>Fundamental Limits of Non-Coherent Interference Alignment via Matroid Theory</title><author>Naderializadeh, Navid ; El Gamal, Aly ; Avestimehr, A. Salman</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c333t-b92ec8d423a6ebee7d984e4a01201be9f51b3b86b25fafc4440032f622ae40ac3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Alignment</topic><topic>Array signal processing</topic><topic>degrees of freedom</topic><topic>Interference</topic><topic>interference cancellation</topic><topic>matrices</topic><topic>Matrices (mathematics)</topic><topic>Matrix converters</topic><topic>Network topologies</topic><topic>Network topology</topic><topic>rank loss</topic><topic>Receivers</topic><topic>Topology</topic><topic>Transmitters</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Naderializadeh, Navid</creatorcontrib><creatorcontrib>El Gamal, Aly</creatorcontrib><creatorcontrib>Avestimehr, A. Salman</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 (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & 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><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Naderializadeh, Navid</au><au>El Gamal, Aly</au><au>Avestimehr, A. Salman</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fundamental Limits of Non-Coherent Interference Alignment via Matroid Theory</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2017-10-01</date><risdate>2017</risdate><volume>63</volume><issue>10</issue><spage>6573</spage><epage>6586</epage><pages>6573-6586</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>We consider the problem of non-coherent interference alignment, in which the goal is to align the signals of multiple interfering transmitters at a single receiver where the transmitters are not aware of the channel state information. We cast this problem as a problem of determining rank loss conditions for a column concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient. We determine necessary and sufficient conditions for the design of each matrix, such that the random ensemble will almost surely lose rank by a certain amount. The result is proved by converting the problem to determining rank loss conditions for the union of some specific matroids, and then using tools from matroid and graph theories to derive the necessary and sufficient conditions. As an application, we discuss how this result can be applied to the problem of topological interference management, and characterize the linear symmetric degrees of freedom for a class of network topologies.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2017.2737010</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0002-0400-4506</orcidid><orcidid>https://orcid.org/0000-0002-4891-6726</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2017-10, Vol.63 (10), p.6573-6586 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_proquest_journals_2174326333 |
| source | IEEE Electronic Library (IEL) |
| subjects | Alignment Array signal processing degrees of freedom Interference interference cancellation matrices Matrices (mathematics) Matrix converters Network topologies Network topology rank loss Receivers Topology Transmitters |
| title | Fundamental Limits of Non-Coherent Interference Alignment via Matroid Theory |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T07%3A04%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fundamental%20Limits%20of%20Non-Coherent%20Interference%20Alignment%20via%20Matroid%20Theory&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Naderializadeh,%20Navid&rft.date=2017-10-01&rft.volume=63&rft.issue=10&rft.spage=6573&rft.epage=6586&rft.pages=6573-6586&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2017.2737010&rft_dat=%3Cproquest_RIE%3E2174326333%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2174326333&rft_id=info:pmid/&rft_ieee_id=8003489&rfr_iscdi=true |