BPSK with Block Coding

Information bits

{bk(1) ,, bk( m) }
Channel coding by mapping m bits to n bits

Code rate is m R = <1 n

BPSK modulator
(1) k ( n) ,, ck }

V cos(2 f ct )

r (t )

Coherent BPSK demodulator

Channel decoding

{b }
k

{ c

Coded bits

w (t ) N AWGN, 2-sided PSD of 0 2

Coded bit error probability is

Block coding adds redundancy by mapping each block of m information bits into a block of n coded bits, where n > m. If properly designed, can help reduce energy per bit (Eb ), while providing the same information rate (rb ) with the same bit error probability (P [error]), but by increasing the transmission bandwidth. Equivalently: For a xed transmission bandwidth, can reduce Eb to achieve the same P [error] by slowing down the information rate rb . Note that = Q
EE456 Digital Communications

2Eb R N0

, where R =

m n

is the code rate.

Ha H. Nguyen

BPSK with Repetition Coding

{bk }
Repetition coding by n times

{bk bk }

BPSK modulator

V cos(2 f ct )

r (t )

Coherent BPSK demodulator

Decoding by majority voting on each block of n coded bits

{b }
k

w (t ) N AWGN, 2-sided PSD of 0 2

Coded bit error probability is

This is a special form of block coding by simply repeating one information bit (m = 1) n times. Let k represent the number of coded bits equal to 1, then the
bk =1

majority voting decision is: k

bk =0 n

n 2.

P [error] =
k= n+1 2

n k (1 )nk , k

=Q

2Eb nN0

EE456 Digital Communications

Ha H. Nguyen

Performance of BPSK with Repetition Coding

10
0

10

n=[3,9,13,17,21] 10 P[error]
2

10

10

10

10

Uncoded BPSK BPSK with repetition code (7,4) Hamming code 2 4 Eb/N0 (dB) 6 8 10

Repetition code turns out to be not useful at all. It is too simple. Upon reection one realizes that the transmitted signals after repetition coding are still a BPSK signal set over a duration of Tb sec (the transmission bandwidth is actually unchanged!). As such optimum BPSK detection surely outperforms the detection based on majority voting.
EE456 Digital Communications Ha H. Nguyen

BPSK with (7,4) Hamming Code

Information bits

{bk(1) ,, bk( m) }
Channel coding by mapping m bits to n bits

Code rate is m R = <1 n

BPSK modulator
(1) k ( n) ,, ck }

V cos(2 f ct )

r (t )

Coherent BPSK demodulator

Channel decoding

{b }
k

{ c
bk bk bk bk (0000) (1000) (0100) (1100) (0010) (1010) (0110) (1110) (0001) (1001) (0101) (1101) (0011) (1011) (0111) (1111)
(1) (2) (3) (4)

Coded bits
ck ck
(1) (2)

w (t ) N AWGN, 2-sided PSD of 0 2

ck
(7)

Coded bit error probability is

(0000000) (1101000) (0110100) (1011100) (1110010) (0011010) (1000110) (0101110) (1010001) (0111001) (1100101) (0001101) (0100011) (1001011) (0010111) (1111111)

ck = ck ck ck = 1 0 (1) (2) (3) (4) bk , bk , bk , bk 1 1

(1) (2)

(7)

1 1 1 0

0 1 1 1

1 0 0 0

0 1 0 0

0 0 1 0

Generator matrix G

0 0 0 1

Note: Multiplication and addition are modulo-2 operations.

Ha H. Nguyen

EE456 Digital Communications

Decoding (7,4) Hamming Code I

For a (n, m) block code, there is (n m) n parity-check matrix H such that every valid codeword c = c(1) , c(2) , , c(n) satises c H = 0. This parity-check matrix H can be used for decoding. The parity-check matrix of the (7,4) Hamming code is 1 0 0 1 0 1 1 H= 0 1 0 1 1 1 0 0 0 1 0 1 1 1

EE456 Digital Communications

Ha H. Nguyen

Decoding (7,4) Hamming Code II

Let y be the length-n vector of the decoded bits after BPSK demodulator. The decoding consists of three steps:
1 2

Compute the syndrome of y, namely y H . Locate the coset leader el whose syndrome is equal to y H . Then el is taken to be the error pattern caused by the channel. Decode the vector y into the codeword c = y + el . From c nd the corresponding k information bits by inverse mapping.

Syndrome (100) (010) (001) (110) (011) (111) (101)

EE456 Digital Communications

Coset leaders (1000000) (0100000) (0010000) (0001000) (0000100) (0000010) (0000001)

Ha H. Nguyen

Performance of BPSK with (7,4) Hamming Code

10
0

10

n=[3,9,13,17,21] 10 P[error]
2

10

10

10

10

Uncoded BPSK BPSK with repetition code (7,4) Hamming code 2 4 Eb/N0 (dB) 6 8 10

P [error]

= +

9 2 (1 )5 + 19 3 (1 )4 + 16 4 (1 )3 2Eb 4 7 12 5 (1 )2 + 7 6 (1 ) + 7 , = Q . N0
Ha H. Nguyen

EE456 Digital Communications

A 4-State Rate-1/3 Convolutional Encoder and Its State Diagram

S2
(1) (2) (3) ck ck ck

01
c
(3) k

011

110
bk 1bk 2

bk

bk 1

bk 2
(2) ck

100
000

00 S 0

S3 11

001

ck(1)

 

101

010

111

S1

10 (b) State diagram

bk = 0

bk = 1

EE456 Digital Communications

Ha H. Nguyen

Trellis Diagram and Viterbi Decoding

bk 1bk 2
(1) (2) (3) ck ck ck

S2

S 0 00
110 001 S 2 01
S3

000
11 1 11 1

000
11 1

000
1 01
11 1

000
1 01

011
000 100
00 S0

01

10 0 1 10 1 10

10 0 1 10

11

01 0

111

S1

101

010

S1 10

01 0
S3 11

11 0

01 0

(b) State diagram

001 (c) Trellis diagram

11 0

10

001

Let be the received signal samples (at the output of (1) (2) (3) the matched lter) corresponding to the coded bits {ck , ck , ck }. (j ) (j ) 3 Then it can be shown that the branch metric is j =1 rk [2ck 1]. With the above branch metric computation, the Viterbi algorithm nds that path through the trellis that maximizes the path metric.
EE456 Digital Communications Ha H. Nguyen

(1) (2) (3) {rk , rk , rk }

Performance Comparison with Uncoded BPSK and (7,4) Hamming-Coded BPSK

10 10 10 P[error] 10 10 10 10 10
0 1

Uncoded BPSK

Rate1/3 4state convolutional code (7,4) Hamming code 0 2 4 Eb/N0 (dB) 6 8 10

EE456 Digital Communications

Ha H. Nguyen

Convolutional Code used in CDMA2000

              !   "  #      !$%% &'()))*+,+  -

EE456 Digital Communications

Ha H. Nguyen

Convolutional Code used in WCDMA

34 567891: ./01 2 ;/6 80< 1: 16 7891: =>0< : /01 2 3? > @ /A @8 91B > 6 19 > 6 ?CDD EF 4GH4 24I

EE456 Digital Communications

Ha H. Nguyen

Convolutional Code used in WiMAX

JKL MNO PQRL STUV WUXW TUYZ[YTY V\ ]^V_ ^Z`TY ^V UZ ]^WLP

EE456 Digital Communications

Ha H. Nguyen