Comsys After Midsem

Detection Error Probability

Band Pass Modulation
By- Naveen Gupta

Transmission of Digital Waveforms through
Carrier Modulation Bandpass Modulation
On-OFF keying
For BPSK, two phases: 0 and pi For QPSK, four phases: 0, pi/2, pi, 3pi/2
A^2/2 = P = E/T
QPSK
BITS Pilani, K K Birla Goa Campus

QPSK

M-ary QAM

QAM Modulator

Scatter plot

Detection Error Probability (Problem)
Solution
In case of On-OFF or Bipolar, only half

pulses are transmitted as compared to
polar case, thus to maintain same power
multiply the amplitude by root 2 for on-off
and bipolar case.
DPSK
DPSK
Information Theory
By- Naveen Gupta
BITS Pilani
Pilani|Dubai|Goa|Hyderabad
Father of Digital Communication
The roots of modern digital communication

stem from the ground-breaking paper “A
Mathematical Theory of Communication” by
Claude Elwood Shannon in 1948.
Shannon’s Definition of
Communication
“The fundamental problem of

communication is that of reproducing at
one point either exactly or approximately
a message selected at another point.”
Shannon wants to find a way for “reliably”

transmitting data throughout the channel at
“maximal” possible rate.

Information Theory
In his 1948 paper he build a rich theory to

the problem of reliable communication,
now called “Information Theory” or “The
Shannon Theory” in honor of him.
Shannon’s Vision
Source Channel
Data
Encoding Encoding
Channel
Source Channel
User
Decoding Decoding

Example : Disc Storage
Data Zip Add CRC
Channel
Verify
User Unzip
CRC

Example: Cellular Phone
Speech CC
Encoding Encoding
Channel
Speech CC
Decoding Decoding
GSM/CDMA
CC stands for Convolutional Code.
Shannon Theory
The original 1948 Shannon Theory contains:
1. Measurement of Information
2. Source Coding Theory
3. Channel Coding Theory

Measurement of Information
Shannon’s first question is

“How to measure information
in terms of bits?” = ? bits
= ? bits
= ? bits = ? bits

Measurement of Information
All events are probabilistic!

Using Probability Theory, Shannon
showed that there is only one way to
measure information in terms of
number of bits:
H ( X )    p( x ) log2 p( x )
x
called the entropy function

Information

Information

Information

Information

More Intuition on Entropy
Assume a binary memoryless source, e.g., a flip of a coin. How much

information do we receive when we are told that the outcome is heads?
– If it’s a fair coin, i.e., P(heads) = P (tails) = 0.5, we say that the amount
of information is 1 bit.
– If we already know that it will be (or was) heads, i.e., P(heads) = 1, the
amount of information is zero!
– If the coin is not fair, e.g., P(heads) = 0.9, the amount of information is
more than zero but less than one bit!
– Intuitively, the amount of information received is the same if P(heads) =

0.9 or P (heads) = 0.1.

Why?
Assume two independent events A and B, with
probabilities P(A) = pA and P(B) = pB.
For both the events to happen, the probability is

pA ¢ pB. However, the amount of information
should be added, not multiplied.
Logarithms satisfy this!

No, we want the information to increase with
decreasing probabilities, so let’s use the negative
logarithm.

Self Information
Example 1:
Example 2:
Which logarithm? Pick the one you like! If you pick the natural log,
you’ll measure in nats, if you pick the 10-log, you’ll get Hartleys,
if you pick the 2-log (like everyone else), you’ll get bits.

Source Coding Theorem,
Huffman’s code, Shannon
Fano Code
Lectures taught on board.

Communications System
Channel Coding
By- Naveen Gupta
BITS Pilani
Error vs Eb/N0

Code rate

Code rate

Important Terminology

Linear Block Codes

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC

LBC
The picture can't be display ed.

LBC

LBC

LBC

LBC
error detecting

Communications Systems
Cyclic Codes
By- Naveen Gupta
BITS Pilani
Cyclic codes

Cyclic codes

CC

CC

CC

CC

CC

CC

CC

CC

Communication System
Convolutional Coding
By- Naveen Gupta
BITS Pilani
Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Communication System
Convolutional Coding
By- Naveen Gupta
BITS Pilani
Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional code

Convolutional Codes

Convolutional Codes

Modulation-Coding Trade-offs




Turbo code
Parallel concatenation of convolutional codes

with Interleaved message.
*taught on board

Comsys After Midsem

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Comsys After Midsem

Uploaded by

Copyright:

Available Formats

Detection Error Probability

Detection Error Probability

By- Naveen Gupta

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

In case of On-OFF or Bipolar, only half

The roots of modern digital communication

“The fundamental problem of

Shannon wants to find a way for “reliably”

BITS Pilani, K K Birla Goa Campus

In his 1948 paper he build a rich theory to

BITS Pilani, K K Birla Goa Campus

Data Zip Add CRC

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

Shannon’s first question is

BITS Pilani, K K Birla Goa Campus

All events are probabilistic!

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

Assume a binary memoryless source, e.g., a flip of a coin. How much

– Intuitively, the amount of information received is the same if P(heads) =

BITS Pilani, K K Birla Goa Campus

For both the events to happen, the probability is

Logarithms satisfy this!

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

Lectures taught on board.

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus

BITS Pilani, K K Birla Goa Campus