Scribd
Upload
2K views

Lossless Deterministic Channel

This document discusses different types of discrete memoryless channels including lossless channels, deterministic channels, noiseless channels, binary symmetric channels, and binary erasure channels. It provides the key properties and formulas to calculate the channel capacity for each type of channel. The maximum channel capacity is achieved when there is no loss of information during transmission from the input to the output.

Uploaded by

Vaibhav Singla
Copyright
© © All Rights Reserved
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
2K views

Lossless Deterministic Channel

This document discusses different types of discrete memoryless channels including lossless channels, deterministic channels, noiseless channels, binary symmetric channels, and binary erasure channels. It provides the key properties and formulas to calculate the channel capacity for each type of channel. The maximum channel capacity is achieved when there is no loss of information during transmission from the input to the output.

Uploaded by

Vaibhav Singla
Copyright
© © All Rights Reserved
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/ 6

EEM 465

FUNDAMENTALS of DATA COMMUNICATIONS


Lecture 5

Lecturer

Assist.Prof.Dr.Nuray At

2
Discrete Memoryless Channels
A discrete memoryless channel (DMC) is a statistical model with an input X and an
output Y.

The channel is discrete when the alphabets of X and Y are both finite
The channel is memoryless when the current output depends only on the
current input and not on any of the previous inputs
is a channel transition probability

1
3

Channel Matrix:
A channel is completely specified by the complete set of transition probabilities.
Accordingly, the channel matrix

Note that each row of the channel matrix must sum to unity.
The input probabilities
The output probabilities

4
Channel Capacity
The channel capacity of a DMC:

the maximum is taken over all possible input distributions p(x)


Lossless Channel: Described by a channel matrix with only one nonzero element
in each column. An example of a lossless channel,

2
5

Capacity of a Lossless Channel:


For a lossless channel, and

The mutual information is equal to the input entropy, and no source information is
lost in transmission. Thus,

Deterministic Channel: Described by a channel matrix with only one nonzero


element in each row. An example of a deterministic channel,

3
7

Capacity of a Deterministic Channel:


For a deterministic channel, for all input distributions, and

The information transfer is equal to the output entropy. Hence

Noiseless Channel: A channel is called noiseless if it is both lossless and


deterministic.

Capacity of a Noiseless Channel:


Since a noiseless channel is both lossless and deterministic,

Thus

4
9

Binary Symmetric Channel (BSC)

The channel matrix is given by,

The probability of receiving a 1 if a 0 is sent is the same as the probability of


receiving a 0 if a 1 is sent.
Thiscommontransitionprobabilityisdenotedbyp.

10

Capacity of Binary Symmetric Channel (BSC)

Thus

5
11

Binary Erasure Channel


The analog of the BSC in which some bits are lost (rather than corrupted). In this
channel, a fraction of the bits are erased. The receiver knows which bits have
been erased.

You might also like