Lect2Channel Capacity

8
EE4601 Communication Systems Lecture 2 Channel Capacity 0 c 2007, Georgia Institute of Technology (lect2 0)

description

lec

Transcript of Lect2Channel Capacity

  • EE4601Communication Systems

    Lecture 2Channel Capacity

    0 c2007, Georgia Institute of Technology (lect2 0)

  • Shannon Capacity of a Channel

    Claude Shannon (1949) proved that every physical channel has a capacity, C,defined as the maximum possible rate that information can be transmitted witharbitrary reliability over the channel.

    Arbitrary reliability means that the bit error probability (BER) can be madeas small as desired.

    Arbitrary reliability is achieved in practice by using forward error correction(FEC) coding techniques.

    Conversely, information cannot be transmitted reliably over a channel at anyrate greater than the channel capacity, C. The BER probability will be equal to1/2 (useless channel).

    The channel capacity depends on the channel transfer function and the receivedbit energy-to-noise ratio (operating SNR).

    0 c2005, Georgia Institute of Technology (lect2 1)

  • Coding Channel and Capacity

    The channel capacity depends only on the coding channel, defined as the portionof the communication system that is seen by the coding system.

    The input to the coding channel is the output of the encoder.

    The output of the coding channel is the input to the decoder.

    The coding channel inputs are symbols chosen from a digital modulation alpha-bet, while the coding channel output are the matched filter outputs in the receiver.

    Encoder

    Decoder

    CodingChannel

    0 c2005, Georgia Institute of Technology (lect2 2)

  • AWGN Channel

    S (f)nN /2o

    -W 0 W

    +s(t)

    n(t)

    r(t) = s(t) + n(t)

    For the AWGN channel (with continuous time input/output), the capacity is

    C = W log2

    (1 +

    P

    NoW

    )

    W = channel bandwidth (Hz)

    P = constrained input signal power (watts)

    No = one-sided noise power spectral density (watts/Hz)

    0 c2005, Georgia Institute of Technology (lect2 3)

  • Capacity of the AWGN Channel

    Dividing both sides by W

    C

    W= log2

    (1 +

    P

    NoW

    )= log2

    (1 +

    EbNo

    RW

    )

    R = 1/T = data rate (bits/second)

    Eb = energy per data bit (Joules) = PT

    Eb/No = received bit energy-to-noise spectral density ratio (dimensionless)

    R/W = bandwidth efficiency (bits/s/Hz)

    If R = C, i.e., we transmit at a rate equal to the channel capacity, then

    C

    W= log2

    (1 +

    EbNo

    CW

    )

    or inverting this equation we get Eb/No in terms of C, viz.

    EbNo

    =2C/W 1

    C/W

    0 c2005, Georgia Institute of Technology (lect2 4)

  • AWGN Channel Capacity

    0 c2005, Georgia Institute of Technology (lect2 5)

  • Capacity of the AWGN Channel

    Example: Suppose that W = 6 MHz (TV channel bandwidth) and SNR =P/(NoW ) = 20 dB. What is the channel capacity?Answer: C = 6 106log2 (1 + 100) = 40 Mbps.

    Asymptotic behavior: as C/W 0.Using LHopitals rule

    limC/W0EbNo

    = limC/W0 2C/W ln 2

    = ln 2

    = 0.693

    = 1.6dBConclusion: It is impossible to communicate on an AWGN channel with arbitraryreliability if Eb/No < 1.6 dB, regardless of how small we make the bandwidthefficiency (or date rate).

    0 c2005, Georgia Institute of Technology (lect2 6)

  • AWGN Channel Capacity

    Power Efficient Region: R/W < 1 bits/s/Hz. In this region we have plentyof bandwidth, but transmit power is limited, e.g., deep space communications.

    Bandwidth Efficient Region: R/W > 1 bits/s/Hz. In this region we haveplenty of power, but bandwidth is limited, e.g., commercial wireless communica-tions.

    Observe that most uncoded modulation schemes operate about 10 dB from theShannon capacity limit for an error rate of 105.

    State-of-the-art turbo coding schemes can close this gap to less than 1 dB,with the cost of additional receiver processing complexity and delay.

    Generally, we can tradeoff power, bandwidth, processing complexity, delay.

    0 c2005, Georgia Institute of Technology (lect2 7)