On the Outage Theorem and its Converse for Discrete Memoryless Channels


Journal PaperWe 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.Noki

    Similar works

    Full text


    Available Versions