A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels
In this correspondence, a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels is proposed. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity tradeoff fo...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2007-11, Vol.53 (11), p.4314-4322 |
|---|---|
| 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 | 4322 |
|---|---|
| container_issue | 11 |
| container_start_page | 4314 |
| container_title | IEEE transactions on information theory |
| container_volume | 53 |
| creator | Nguyen, K.D. Guillen i Fabregas, A. Rasmussen, L.K. |
| description | In this correspondence, a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels is proposed. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity tradeoff for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant. |
| doi_str_mv | 10.1109/TIT.2007.907520 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_19204462</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4374180</ieee_id><sourcerecordid>1671400709</sourcerecordid><originalsourceid>FETCH-LOGICAL-c433t-4d08d682ded609bda6631b24bdd2a7c530ab955ab31bce2fd63bc16883ef4df73</originalsourceid><addsrcrecordid>eNp9kT1v2zAQhomiBeqmnTt04dIiQ-TwS6Q0Ok6TGjCQDk5XgiJPNhtFdEkKQf59aShIt06Hu3vu8N69CH2mZEkpaS93m92SEaKWLVE1I2_Qgta1qlpZi7doQQhtqlaI5j36kNLvkoqasgW6X-Gd3x8y3oYniPgqTKPDOeB8AHw3ZbMH_DOGznR-8PkZhx5f-2QjZKg243HK-GoI9qG6Mc6Pe7w-mHGEIX1E73ozJPj0Es_Q_c333fpHtb273axX28oKznMlHGmcbJgDJ0nbOSMlpx0TnXPMKFtzYrq2rk1XqhZY7yTvLJVNw6EXrlf8DF3Me9MTHKdOH6N_NPFZB-P1tf-10iHu9UM-aMkkYwX_NuPHGP5MkLJ-LMfAMJgRwpQ0F4pw1fACnv8XpFJRUX5N2oJezqiNIaUI_asISvTJGF2M0Sdj9GxMmfj6stwka4Y-mtH69G-sZUQIeVL7ZeY8ALy2BVeCNoT_Ba5hlfE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1671400709</pqid></control><display><type>article</type><title>A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels</title><source>IEEE Electronic Library (IEL)</source><creator>Nguyen, K.D. ; Guillen i Fabregas, A. ; Rasmussen, L.K.</creator><creatorcontrib>Nguyen, K.D. ; Guillen i Fabregas, A. ; Rasmussen, L.K.</creatorcontrib><description>In this correspondence, a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels is proposed. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity tradeoff for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.</description><identifier>ISSN: 0018-9448</identifier><identifier>ISSN: 1557-9654</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2007.907520</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Australia ; Block-fading channel ; Blocking ; Channels ; Coding, codes ; Constellation diagram ; Delay ; diversity ; Error probability ; Exact sciences and technology ; Fading ; Gain ; GSM ; Information theory ; Information, signal and communications theory ; Lower bounds ; OFDM ; Optimization ; outage probability ; Outages ; rate-diversity tradeoff ; Signal and communications theory ; Signal to noise ratio ; signal-to-noise ratio (SNR)-exponent ; Systems design ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Transmission and modulation (techniques and equipments) ; Upper bound ; Wireless communication</subject><ispartof>IEEE transactions on information theory, 2007-11, Vol.53 (11), p.4314-4322</ispartof><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c433t-4d08d682ded609bda6631b24bdd2a7c530ab955ab31bce2fd63bc16883ef4df73</citedby><cites>FETCH-LOGICAL-c433t-4d08d682ded609bda6631b24bdd2a7c530ab955ab31bce2fd63bc16883ef4df73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4374180$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,314,780,784,796,885,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4374180$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19204462$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-62622$$DView record from Swedish Publication Index$$Hfree_for_read</backlink></links><search><creatorcontrib>Nguyen, K.D.</creatorcontrib><creatorcontrib>Guillen i Fabregas, A.</creatorcontrib><creatorcontrib>Rasmussen, L.K.</creatorcontrib><title>A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>In this correspondence, a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels is proposed. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity tradeoff for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.</description><subject>Applied sciences</subject><subject>Australia</subject><subject>Block-fading channel</subject><subject>Blocking</subject><subject>Channels</subject><subject>Coding, codes</subject><subject>Constellation diagram</subject><subject>Delay</subject><subject>diversity</subject><subject>Error probability</subject><subject>Exact sciences and technology</subject><subject>Fading</subject><subject>Gain</subject><subject>GSM</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Lower bounds</subject><subject>OFDM</subject><subject>Optimization</subject><subject>outage probability</subject><subject>Outages</subject><subject>rate-diversity tradeoff</subject><subject>Signal and communications theory</subject><subject>Signal to noise ratio</subject><subject>signal-to-noise ratio (SNR)-exponent</subject><subject>Systems design</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>Upper bound</subject><subject>Wireless communication</subject><issn>0018-9448</issn><issn>1557-9654</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kT1v2zAQhomiBeqmnTt04dIiQ-TwS6Q0Ok6TGjCQDk5XgiJPNhtFdEkKQf59aShIt06Hu3vu8N69CH2mZEkpaS93m92SEaKWLVE1I2_Qgta1qlpZi7doQQhtqlaI5j36kNLvkoqasgW6X-Gd3x8y3oYniPgqTKPDOeB8AHw3ZbMH_DOGznR-8PkZhx5f-2QjZKg243HK-GoI9qG6Mc6Pe7w-mHGEIX1E73ozJPj0Es_Q_c333fpHtb273axX28oKznMlHGmcbJgDJ0nbOSMlpx0TnXPMKFtzYrq2rk1XqhZY7yTvLJVNw6EXrlf8DF3Me9MTHKdOH6N_NPFZB-P1tf-10iHu9UM-aMkkYwX_NuPHGP5MkLJ-LMfAMJgRwpQ0F4pw1fACnv8XpFJRUX5N2oJezqiNIaUI_asISvTJGF2M0Sdj9GxMmfj6stwka4Y-mtH69G-sZUQIeVL7ZeY8ALy2BVeCNoT_Ba5hlfE</recordid><startdate>20071101</startdate><enddate>20071101</enddate><creator>Nguyen, K.D.</creator><creator>Guillen i Fabregas, A.</creator><creator>Rasmussen, L.K.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</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>F28</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>ADTPV</scope><scope>AOWAS</scope><scope>D8V</scope></search><sort><creationdate>20071101</creationdate><title>A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels</title><author>Nguyen, K.D. ; Guillen i Fabregas, A. ; Rasmussen, L.K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c433t-4d08d682ded609bda6631b24bdd2a7c530ab955ab31bce2fd63bc16883ef4df73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Applied sciences</topic><topic>Australia</topic><topic>Block-fading channel</topic><topic>Blocking</topic><topic>Channels</topic><topic>Coding, codes</topic><topic>Constellation diagram</topic><topic>Delay</topic><topic>diversity</topic><topic>Error probability</topic><topic>Exact sciences and technology</topic><topic>Fading</topic><topic>Gain</topic><topic>GSM</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Lower bounds</topic><topic>OFDM</topic><topic>Optimization</topic><topic>outage probability</topic><topic>Outages</topic><topic>rate-diversity tradeoff</topic><topic>Signal and communications theory</topic><topic>Signal to noise ratio</topic><topic>signal-to-noise ratio (SNR)-exponent</topic><topic>Systems design</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>Upper bound</topic><topic>Wireless communication</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Nguyen, K.D.</creatorcontrib><creatorcontrib>Guillen i Fabregas, A.</creatorcontrib><creatorcontrib>Rasmussen, L.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 (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>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering 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>SwePub</collection><collection>SwePub Articles</collection><collection>SWEPUB Kungliga Tekniska Högskolan</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Nguyen, K.D.</au><au>Guillen i Fabregas, A.</au><au>Rasmussen, L.K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2007-11-01</date><risdate>2007</risdate><volume>53</volume><issue>11</issue><spage>4314</spage><epage>4322</epage><pages>4314-4322</pages><issn>0018-9448</issn><issn>1557-9654</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>In this correspondence, a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels is proposed. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity tradeoff for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2007.907520</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2007-11, Vol.53 (11), p.4314-4322 |
| issn | 0018-9448 1557-9654 1557-9654 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19204462 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Australia Block-fading channel Blocking Channels Coding, codes Constellation diagram Delay diversity Error probability Exact sciences and technology Fading Gain GSM Information theory Information, signal and communications theory Lower bounds OFDM Optimization outage probability Outages rate-diversity tradeoff Signal and communications theory Signal to noise ratio signal-to-noise ratio (SNR)-exponent Systems design Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Upper bound Wireless communication |
| title | A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T07%3A01%3A20IST&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=A%20Tight%20Lower%20Bound%20to%20the%20Outage%20Probability%20of%20Discrete-Input%20Block-Fading%20Channels&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Nguyen,%20K.D.&rft.date=2007-11-01&rft.volume=53&rft.issue=11&rft.spage=4314&rft.epage=4322&rft.pages=4314-4322&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2007.907520&rft_dat=%3Cproquest_RIE%3E1671400709%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=1671400709&rft_id=info:pmid/&rft_ieee_id=4374180&rfr_iscdi=true |