Connexions

You are here: Home » Content » Channel Capacity
Content Actions
Lenses

What is a lens?

Lenses

A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

What is in a lens?

Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

Who can create a lens?

Any individual Connexions member, a community, or a respected organization.

This content is ...
Affiliated with (?)
This content is either by members of the organizations listed or about topics related to the organizations listed. Click each link to see a list of all content affiliated with the organization.

  • This module is included inLens: Rice University OpenCourseWare
    By: OpenCourseWare ConsortiumAs a part of collection:"Digital Communication Systems"

    Click the "Rice University OCW" link to see all content affiliated with them.

    Rice University OCW
Tags

(?)

These tags come from the endorsement, affiliation, and other lenses that include this content.

Channel Capacity

Module by: Behnaam Aazhang

Summary: A discussion of channels and how much information can be sent through a channel reliably.

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.
Figure7-28.png
Figure 1
Let us denote the input sequence to the channel as
X= X 1 X 2 ⋮ X n X X 1 X 2 ⋮ X n (1)
where X i ∈ X ¯ X i X ¯ a discrete symbol set or input alphabet.
The channel output
Y= Y 1 Y 2 Y 3 ⋮ Y n Y Y 1 Y 2 Y 3 ⋮ Y n (2)
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
p Y | X y | x =∏i=1n p Y i | X i y i | x i p Y | X y | x i 1 n p Y i | X i y i | x i (3)
for all y∈ Y ¯ n y Y ¯ n and for all x∈ X ¯ n x X ¯ n .
Example 1 
A binary symmetric channel (BSC) is a discrete memoryless channel with binary input and binary output and p Y | X y=0 | x=1 = p Y | X y=1 | x=0 p Y | X y=0 | x=1 p Y | X y=1 | x=0 . As an example, a white Gaussian channel with antipodal signaling and matched filter receiver has probability of error of Q2 E s N 0 Q 2 E s N 0 . Since the error is symmetric with respect to the transmitted bit, then
p Y | X 0 | 1 = p Y | X 1 | 0 =Q2 E s N 0 =ε p Y | X 0 | 1 p Y | X 1 | 0 Q 2 E s N 0 ε (4)
Figure7-30.png
Figure 2
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.

Comments, questions, feedback, criticisms?

Send feedback