Scribd
Upload
31 views62 pages

Symmetric Channels

This document discusses information theory and channel coding. It introduces different channel models like the binary symmetric channel and binary erasure channel. It defines key concepts such as channel capacity, convex and non-convex sets, and jointly typical pairs of sequences. The document also discusses how channel codes can be used for communication over noisy channels and examines bounds on error probabilities.

Uploaded by

Anonymous lrILoRYJW
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views62 pages

Symmetric Channels

This document discusses information theory and channel coding. It introduces different channel models like the binary symmetric channel and binary erasure channel. It defines key concepts such as channel capacity, convex and non-convex sets, and jointly typical pairs of sequences. The document also discusses how channel codes can be used for communication over noisy channels and examines bounds on error probabilities.

Uploaded by

Anonymous lrILoRYJW
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 62

ELEC 619A Selected Topics in Digital Communications: Information Theory

Channel Capacity and Coding

Channel
``The channel is merely the medium used to the signal from transmitter to receiver. It may be a pair of wires, a coaxial cable, a band of radio frequencies, a beam of light, etc. More abstractly, the channel is ``that part of the communication system that is either unwilling or unable to change

Binary Symmetric Channel

Binary Errors with Erasure Channel


1-p-q
0 0

q e

p 1

q 1-p-q

Convex and Non-convex Sets

3-Dimensional Probability Distribution

Convex Functions

17

Channel Capacity

Binary Symmetric Channel

21

Symmetric Channels

Binary Erasure Channel

Other Models
0 X 1
p

0 (light on) Y

1-p

1-p

e
1 (light off) 1
p 1-p

Z-channel (optical)

Binary Erasure Channel (BEC)

Symmetric Channel Example

Non-Symmetric Channel Example

Noisy Communication System

Channel Code

Jointly Typical Pairs of Sequences

Noisy Communication System

The Data Processing Lemma


Cascaded Channels
I(W;Y)
W

I(W;X)

I(X;Y)

The overall transmission rate I(W;Y) for the cascade cannot be larger than I(W;X) or I(X;Y), so that

I (W ; Y ) I (W ; X )

I (W ; Y ) I ( X ; Y )

Channel Capacity: Converse


For R > C the decoding error probability > 0

Pe

R C

Random Coding Exponent

Error Bounds
Random coding bound Expurgated bound Space-partitioning bound
Sphere-packing bound Straight-line bound

You might also like