Error Exponents of Optimum Decoding for the Interference Channel
Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that have been used in previous works, like joint typicality deco...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2010-01, Vol.56 (1), p.40-56 |
|---|---|
| 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 | 56 |
|---|---|
| container_issue | 1 |
| container_start_page | 40 |
| container_title | IEEE transactions on information theory |
| container_volume | 56 |
| creator | Etkin, R.H. Merhav, N. Ordentlich, E. |
| description | Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that have been used in previous works, like joint typicality decoding, decoding based on interference cancellation, and decoding that considers the interference as additional noise. Indeed, the fact that the actual interfering signal is a codeword and not an independent and identically distributed (i.i.d.) noise process complicates the application of conventional techniques to the performance analysis of the optimum decoder. Using analytical tools rooted in statistical physics, we derive a single-letter expression for error exponents achievable under optimum decoding and demonstrate strict improvement over error exponents obtainable using suboptimal decoding rules, but which are amenable to more conventional analysis. |
| doi_str_mv | 10.1109/TIT.2009.2034892 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_5361471</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5361471</ieee_id><sourcerecordid>1935946491</sourcerecordid><originalsourceid>FETCH-LOGICAL-c385t-c2811204477b9d886de64e089cc85dda7920244dcde4e1ef16ed70bb9396327b3</originalsourceid><addsrcrecordid>eNp90E1LAzEQBuAgCtbqXfCyCKKXrZl8bXJTatVCoZd6DtvsrF3ZZmuyBf33prR48OBlwpBnBuYl5BLoCICa-8V0MWKUmlS40IYdkQFIWeRGSXFMBpSCzo0Q-pScxfiRWiGBDcjDJIQuZJOvTefR9zHr6my-6Zv1dp09oeuqxr9ndRL9CrOp7zHUGNA7zMar0ntsz8lJXbYRLw7vkLw9Txbj13w2f5mOH2e541r2uWMagFEhimJpKq1VhUog1cY5LauqLAyjTIjKVSgQsAaFVUGXS8ON4qxY8iG53e_dhO5zi7G36yY6bNvSY7eNVoPWnClukrz7V4IqgDHJQSV6_Yd-dNvg0x0WjDSCgmEJ0T1yoYsxYG03oVmX4dsCtbvsbcre7rK3h-zTyM1hbxld2dah9K6Jv3OMCcOBQnJXe9cg4u-35ApEAfwHF-2KaQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195940192</pqid></control><display><type>article</type><title>Error Exponents of Optimum Decoding for the Interference Channel</title><source>IEEE Electronic Library (IEL)</source><creator>Etkin, R.H. ; Merhav, N. ; Ordentlich, E.</creator><creatorcontrib>Etkin, R.H. ; Merhav, N. ; Ordentlich, E.</creatorcontrib><description>Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that have been used in previous works, like joint typicality decoding, decoding based on interference cancellation, and decoding that considers the interference as additional noise. Indeed, the fact that the actual interfering signal is a codeword and not an independent and identically distributed (i.i.d.) noise process complicates the application of conventional techniques to the performance analysis of the optimum decoder. Using analytical tools rooted in statistical physics, we derive a single-letter expression for error exponents achievable under optimum decoding and demonstrate strict improvement over error exponents obtainable using suboptimal decoding rules, but which are amenable to more conventional analysis.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2009.2034892</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Channels ; Codes ; Coding, codes ; Decoding ; Detection, estimation, filtering, equalization, prediction ; Electric noise ; Error analysis ; Error exponent region ; Error probability ; Exact sciences and technology ; Exponents ; Information theory ; Information, signal and communications theory ; Interference ; Interference cancellation ; Interference channels ; Laboratories ; large deviations ; Mathematical analysis ; Maximum likelihood decoding ; method of types ; Noise ; Noise cancellation ; Optimization ; Performance analysis ; Physics ; Radiocommunications ; Receivers & amplifiers ; Signal and communications theory ; Signal processing ; Signal, noise ; statistical physics ; Telecommunications ; Telecommunications and information theory ; Transmitters ; Transmitters. Receivers</subject><ispartof>IEEE transactions on information theory, 2010-01, Vol.56 (1), p.40-56</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c385t-c2811204477b9d886de64e089cc85dda7920244dcde4e1ef16ed70bb9396327b3</citedby><cites>FETCH-LOGICAL-c385t-c2811204477b9d886de64e089cc85dda7920244dcde4e1ef16ed70bb9396327b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5361471$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,781,785,797,4025,27927,27928,27929,54762</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5361471$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22493101$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Etkin, R.H.</creatorcontrib><creatorcontrib>Merhav, N.</creatorcontrib><creatorcontrib>Ordentlich, E.</creatorcontrib><title>Error Exponents of Optimum Decoding for the Interference Channel</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that have been used in previous works, like joint typicality decoding, decoding based on interference cancellation, and decoding that considers the interference as additional noise. Indeed, the fact that the actual interfering signal is a codeword and not an independent and identically distributed (i.i.d.) noise process complicates the application of conventional techniques to the performance analysis of the optimum decoder. Using analytical tools rooted in statistical physics, we derive a single-letter expression for error exponents achievable under optimum decoding and demonstrate strict improvement over error exponents obtainable using suboptimal decoding rules, but which are amenable to more conventional analysis.</description><subject>Applied sciences</subject><subject>Channels</subject><subject>Codes</subject><subject>Coding, codes</subject><subject>Decoding</subject><subject>Detection, estimation, filtering, equalization, prediction</subject><subject>Electric noise</subject><subject>Error analysis</subject><subject>Error exponent region</subject><subject>Error probability</subject><subject>Exact sciences and technology</subject><subject>Exponents</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Interference</subject><subject>Interference cancellation</subject><subject>Interference channels</subject><subject>Laboratories</subject><subject>large deviations</subject><subject>Mathematical analysis</subject><subject>Maximum likelihood decoding</subject><subject>method of types</subject><subject>Noise</subject><subject>Noise cancellation</subject><subject>Optimization</subject><subject>Performance analysis</subject><subject>Physics</subject><subject>Radiocommunications</subject><subject>Receivers & amplifiers</subject><subject>Signal and communications theory</subject><subject>Signal processing</subject><subject>Signal, noise</subject><subject>statistical physics</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmitters</subject><subject>Transmitters. Receivers</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp90E1LAzEQBuAgCtbqXfCyCKKXrZl8bXJTatVCoZd6DtvsrF3ZZmuyBf33prR48OBlwpBnBuYl5BLoCICa-8V0MWKUmlS40IYdkQFIWeRGSXFMBpSCzo0Q-pScxfiRWiGBDcjDJIQuZJOvTefR9zHr6my-6Zv1dp09oeuqxr9ndRL9CrOp7zHUGNA7zMar0ntsz8lJXbYRLw7vkLw9Txbj13w2f5mOH2e541r2uWMagFEhimJpKq1VhUog1cY5LauqLAyjTIjKVSgQsAaFVUGXS8ON4qxY8iG53e_dhO5zi7G36yY6bNvSY7eNVoPWnClukrz7V4IqgDHJQSV6_Yd-dNvg0x0WjDSCgmEJ0T1yoYsxYG03oVmX4dsCtbvsbcre7rK3h-zTyM1hbxld2dah9K6Jv3OMCcOBQnJXe9cg4u-35ApEAfwHF-2KaQ</recordid><startdate>201001</startdate><enddate>201001</enddate><creator>Etkin, R.H.</creator><creator>Merhav, N.</creator><creator>Ordentlich, E.</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>201001</creationdate><title>Error Exponents of Optimum Decoding for the Interference Channel</title><author>Etkin, R.H. ; Merhav, N. ; Ordentlich, E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c385t-c2811204477b9d886de64e089cc85dda7920244dcde4e1ef16ed70bb9396327b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Applied sciences</topic><topic>Channels</topic><topic>Codes</topic><topic>Coding, codes</topic><topic>Decoding</topic><topic>Detection, estimation, filtering, equalization, prediction</topic><topic>Electric noise</topic><topic>Error analysis</topic><topic>Error exponent region</topic><topic>Error probability</topic><topic>Exact sciences and technology</topic><topic>Exponents</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Interference</topic><topic>Interference cancellation</topic><topic>Interference channels</topic><topic>Laboratories</topic><topic>large deviations</topic><topic>Mathematical analysis</topic><topic>Maximum likelihood decoding</topic><topic>method of types</topic><topic>Noise</topic><topic>Noise cancellation</topic><topic>Optimization</topic><topic>Performance analysis</topic><topic>Physics</topic><topic>Radiocommunications</topic><topic>Receivers & amplifiers</topic><topic>Signal and communications theory</topic><topic>Signal processing</topic><topic>Signal, noise</topic><topic>statistical physics</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmitters</topic><topic>Transmitters. Receivers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Etkin, R.H.</creatorcontrib><creatorcontrib>Merhav, N.</creatorcontrib><creatorcontrib>Ordentlich, E.</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>Pascal-Francis</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><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Etkin, R.H.</au><au>Merhav, N.</au><au>Ordentlich, E.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Error Exponents of Optimum Decoding for the Interference Channel</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2010-01</date><risdate>2010</risdate><volume>56</volume><issue>1</issue><spage>40</spage><epage>56</epage><pages>40-56</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that have been used in previous works, like joint typicality decoding, decoding based on interference cancellation, and decoding that considers the interference as additional noise. Indeed, the fact that the actual interfering signal is a codeword and not an independent and identically distributed (i.i.d.) noise process complicates the application of conventional techniques to the performance analysis of the optimum decoder. Using analytical tools rooted in statistical physics, we derive a single-letter expression for error exponents achievable under optimum decoding and demonstrate strict improvement over error exponents obtainable using suboptimal decoding rules, but which are amenable to more conventional analysis.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2009.2034892</doi><tpages>17</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2010-01, Vol.56 (1), p.40-56 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_ieee_primary_5361471 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Channels Codes Coding, codes Decoding Detection, estimation, filtering, equalization, prediction Electric noise Error analysis Error exponent region Error probability Exact sciences and technology Exponents Information theory Information, signal and communications theory Interference Interference cancellation Interference channels Laboratories large deviations Mathematical analysis Maximum likelihood decoding method of types Noise Noise cancellation Optimization Performance analysis Physics Radiocommunications Receivers & amplifiers Signal and communications theory Signal processing Signal, noise statistical physics Telecommunications Telecommunications and information theory Transmitters Transmitters. Receivers |
| title | Error Exponents of Optimum Decoding for the Interference Channel |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T23%3A13%3A50IST&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=Error%20Exponents%20of%20Optimum%20Decoding%20for%20the%20Interference%20Channel&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Etkin,%20R.H.&rft.date=2010-01&rft.volume=56&rft.issue=1&rft.spage=40&rft.epage=56&rft.pages=40-56&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2009.2034892&rft_dat=%3Cproquest_RIE%3E1935946491%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=195940192&rft_id=info:pmid/&rft_ieee_id=5361471&rfr_iscdi=true |