*Signal space diagram of QPSK signal

BFSK
Binary Frequency Shift Keying

*Principle of BFSK
1, 0 symbols 1 bit
1&0 - distinguished by transmitting waves that differ in frequency.
Tb- bit duration= symbol duration
Eb- Energy of bit = symbol energy

2 Eb
cos 2f i t , 0 t Tb

Transmitted signals are si t Tb

elsewhere
0,
where

nc i
fi
; i 1,2
Tb

symbol 1 f1
symbol 0 f2

S1(t) -transmitted signal ,represents symbol 1

S2(t) transmitted signal , represents symbol 0
2 Eb
cos2f1t , 0 t Tb

s1t Tb
0,
elsewhere

2 Eb
cos2f 2t , 0 t Tb

s 2t Tb
0,
elsewhere

There are two basis functions written as

2
cos2f1t , 0 t Tb

1 t Tb
0,
elsewhere

2
cos2f 2t , 0 t Tb

2 t Tb
0,
elsewhere

 1 =

2 =

1 t

2 t

As a result, the signal vectors are

Eb
0
s1
and s 2

E
b
0

*Signal space diagram of BFSK

Distance between two points ,

= 2


Symbol 1- f1 frequency say, f1= 2fb
Symbol 0 f2 frequency say, f2= fb

*MODEMS of BFSK
1. Generation of coherent BFSK signal / Modulator

TRANSMITTER

 On off level encoder

Unipolar
Converts 0 0

For Symbol 1,
On off level encoder o/p =
=
Upper channel o/p = m(t)1 t

= 1 t = s1(t)
Lower channel o/p = ()2 t
=0 = s2(t)
S(t) = s1(t) + s2(t) = s1(t)

For Symbol 0
On off level encoder o/p = 0
=0
Upper channel o/p = 0= s1(t)
() = ()
Lower channel o/p = ()2 t
= s2(t)
S(t) = s1(t) + s2(t) = s2(t)

2. Detection of coherent BFSK signal/ Demodulator

RECEIVER

 Noisy received signal, = (t) + w(t)

Two matched filters with 1 and 2 observation

vectors
1 =
2 =

()1 (t) dt
0

()2 (t) dt
0

 For symbol 0,

For symbol 1 ,
1 =
2 =

1 ()1 (t) dt =
0

1 ()2 (t) dt =
0

= 1 2 =

1 =
2 =

= 1 2 = -

Decision device output,

If y>0 : symbol 1
If y<0 : symbol 0

2 ()1 (t) dt = 0
0

2 ()2 (t) dt =
0

*Bandwidth of BFSK
If Tb is the bit duration &

1
fb=

Symbol 1 , Centered at f1 2fb

Symbol 0, Centered at f2 2fb

Total bandwidth = 4fb

= bit rate

*
Probability of bit error = probability of symbol
error
Symbol 1 : x(t) = s1(t) + w(t)
Symbol 0: x(t) = s2(t) +w(t)

Two decision regions : z1 and z2

 Receiver decision in favour of 1:

When 1 > 2
falls under 1 region
=

Receiver decision in favour of 0:

When 1 < 2
falls under 2region
=

 Mean of y , when symbol 1 was transmitted,

Mean of y , when symbol 0 was transmitted,

Variance of Y,

 Conditional probability density function of y

=?

Suppose symbol 0 transmitted,

CPDF =

 Prob of error, for 0 transmitted, 1 received

P10 =

Substitute ,

 Similarly
Eb
1
P01 erfc
2
2N0

 Average probability of symbol error = bit error

rate for BFSK,
Eb
1
Pe erfc
2N
2
0

Amplitude Shift Keying

(ASK)

 On- off keying

Symbol 1 pulse transmitted
Symbol 0 no pulse

* Principle of ASK
Transmitted signal
Symbol 1: (0t )

Symbol 0 : (0t )
S(t) = 0

Orthonormal basis function:

For symbol 1:

For symbol 0:

S(t) = 0

* Signal constellation for ASK

*ASK transmitter

* Detection of ASK signal

 Noisy received signal, = (t) + w(t)

matched filter o/p: 1 observation vector

1 =

()
(t)
1
0

dt

*Bandwidth of ASK
Bandwidth = 2fb
fb = bit rate = 1/Tb

*Probability of error
Received signal ,
+ : 0
=

0
Matched filter o/p ,
1 =

()1 (t)
0

dt

 When symbol 1 transmitted,

1 =
[1] =
[1] = 0/2
When symbol 0 transmitted,
[1] = 0
[1] = 0/2

 Conditional probability density function or

random variable x1 = ?
Symbol 1 transmitted,
Cpdf=
Symbol 0 transmitted,
Cpdf =

Cases of Error
Symbol 1 transmitted,
s/g falls under 2 region
Ie : 1 <

Symbol 0 transmitted,
s/g falls under 2 region
Ie : 1 >

 Probability of error ,
P01=

 Substitute

1
0

 P01 = P10 =

1
2

1
erfc(
2

)
0

= average probability of symbol error = BER

DPSK
Non coherent version of PSK
Eliminate the need of coherent reference
signal at the receiver side
Combination of
1) Differential encoding of input binary wave
2) Phase shift keying

 Send symbol 1,
No phase change
Send symbol 0,
Phase advances by 180 degree

DPSK transmitter

Illustration of generation of DPSK

signal

*detection of DPSK signal

BPF- removes undesired frequency components

Decoding : bk = + 1 : xnor operation
dk-1
dk
bk

 Case 1: symbol 1, symbol 1

1 =
Case 2: symbol 1, symbol 0
1 =

Receiver decision: 1 > 0: 1

1 < 0: 0

* Bandwidth of DPSK
BW= fb

Since,2Tb is the symbol duration

Erfc(u)= 1-erf(u)

Error control coding

 Channel encoding
Accepts msg bits
Add parity bits along with msg bit
Parity generation

Channel decoding
- Parity checking for detecting msg signal

Channel encoder
Block code
Sending information as blocks
No memory requirement

Convolutional code
Bit by bit
Serially
With memory

Block codes
Linear block codes
Cyclic codes

Channel decoder
Syndrome decoder
Block codes

Viterbi decoder
Convolutional codes

Block code
General representation
:
(n, k) block codes
n ->no: of code words
k >no: of msg bits
n-k ->no: of parity bits added

Linear block code

A code is said to be linear if any two code
words in the code can be added in modulo-2
arithmetic to produce a third code word in the
code

Modulo-2 arithmetic
Xor operation

Linear Block Codes

A vector notation is used for the msg bits
and codewords,
Dataword m = (m0 m1.mk-1)
Codeword c = (c0 c1..cn-1)
Parity bits b= (b0 b1..bn-k-1)

the code rate,

Code rate = k/n

Linear Block Code - Example

msg length k = 4
Codeword length n = 7
This is a (7,4) block code with code rate = 4/7
For example, m = (1101), c = (0011101)

 b- linear combination of msg bits

Structure of a lbc

Matrix representation

 Considering p as the co-efficient k x (n-k)

matrix

Parity Generator

Define k by n generator matrix

Ik-k by k identity matrix

 Block diagram representation of generator

equation

Parity check equation for lbc

Take H, as parity check matrix orthogonal to
G(generator matrix)

Parity
check
equation

 Indicates transmitted vector received correctly

or not.