In the previous section, we discussed information sources and quantified information. We also discussed how to represent (and compress) information sources in binary symbols in an efficient manner. In this section, we consider channels and will find out how much information can be sent through the channel reliably.

We will first consider simple channels where the input is a discrete random variable and the output is also a discrete random variable. These discrete channels could represent analog channels with modulation and demodulation and detection.

Let us denote the input sequence to the channel as

where X i ∈ X ¯ X i X ¯ a discrete symbol set or input alphabet.

The channel output

where Y i ∈ Y ¯ Y i Y ¯ a discrete symbol set or output alphabet.

The statistical properties of a channel are determined if one finds p Y | X ⁢ y | x p Y | X y | x for all y∈ Y ¯ n y Y ¯ n and for all x∈ X ¯ n x X ¯ n . A discrete channel is called a discrete memoryless channel if

for all y∈ Y ¯ n y Y ¯ n and for all x∈ X ¯ n x X ¯ n .

It is interesting to note that every time a BSC is used one bit is sent across the channel with probability of error of εε. The question is how much information or how many bits can be sent per channel use, reliably. Before we consider the above question a few definitions are essential. These are discussed in mutual information.

Content actions

Footer

This work is licensed by Behnaam Aazhang under a Creative Commons Attribution License (CC-BY 1.0), and is an Open Educational Resource.

Last edited by Charlet Reedstrom on Oct 26, 2005 8:32 pm -0500.