On the Outage Theorem and its Converse for Discrete Memoryless Channels

Simple item page
dc.citation.bibtexNamearticleen_US
dc.citation.journalTitleIEEE Transactions on Information Theoryen_US
dc.contributor.authorMuharemovic, Tariken_US
dc.contributor.authorAazhang, Behnaamen_US
dc.contributor.orgCenter for Multimedia Communications (http://cmc.rice.edu/)en_US
dc.date.accessioned2007-10-31T00:53:45Zen_US
dc.date.available2007-10-31T00:53:45Zen_US
dc.date.issued2002-01-15en_US
dc.date.modified2003-11-09en_US
dc.date.submitted2003-01-07en_US
dc.descriptionJournal Paperen_US
dc.description.abstractWe prove both the outage theorem and its converse for block fading discrete memoryless channel. If <i>P<sub>out</sub></i> is the outage probability for the rate <i>R</i> then any transmission rate below <i>R</i> together with any average error probability greater than <i>P<sub>out</sub></i> is achievable. Conversely, for any code with rate slightly greater than <i>R</i> the error probability is greater than any number smaller than <i>P<sub>out</sub></i>, for large codeword lengths. Two cases are considered depending on whether the transmitter has channel state information (CSI) or not.en_US
dc.description.sponsorshipNokiaen_US
dc.identifier.citationT. Muharemovic and B. Aazhang, "On the Outage Theorem and its Converse for Discrete Memoryless Channels," <i>IEEE Transactions on Information Theory,</i> 2002.en_US
dc.identifier.urihttps://hdl.handle.net/1911/20105en_US
dc.language.isoengen_US
dc.subjectOutage Probabilityen_US
dc.subjectConverseen_US
dc.subject.keywordOutage Probabilityen_US
dc.subject.keywordConverseen_US
dc.titleOn the Outage Theorem and its Converse for Discrete Memoryless Channelsen_US
dc.typeJournal articleen_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Muh2002Non1OntheOutag.PDF
Size:
172.23 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications