MSICE Thesis

on

DIRTY PAPER CODE DESIGN

FOR
MULTIUSER MIMO BROADCAST
CHANNEL
By:
Krishna Prasad Phelu Supervisor:
(Exam Roll No. 102204) Daya Sagar Baral
Asst. Professor, IOE

Date: November 2012

 2

Presentation Outline

• Motivation
• Problem definition
• Objectives
• Dirty paper code (DPC)
• Multiuser MIMO Broadcast channel
• Methodology
• Results and Discussion
• Conclusion
• Limitation and Future work
 3

Motivation
• Dirty paper code (DPC) can recover capacity loss
due to interference.

• Multiuser MIMO has lots of advantages over

ordinary point to point MIMO system.

• DPC is capacity achieving code for MU-MIMO

broadcast scenario.
 4

Problem Definition
• Dirty paper code (DPC) design is a combined
source-channel code design problem.

• In Multiuser MIMO BC base station should

perform pre-equalization.
 5

Objectives

• To study on Dirty Paper Code (DPC).

• To design Dirty Paper Code based on nested

trellis using trellis coded quantization /trellis
coded modulation (TCQ/TCM) scheme.

• To implement Dirty Paper Code for MU- MIMO

Broadcast Channel.
 6

Dirty Paper Code (DPC)

Figure: General DPC Channel.

1 PX
Capacity from Shannon’s capacity formula C  ln(1  )
2 PZ  PS
1 P
Capacity from DPC capacity formula C  ln(1  X )
2 PZ

So, no capacity loss due to interference

known to the transmitter non-casually
 7

Multiuser MIMO Broadcast Channel

• In MIMO system transmitting and receiving
terminals have multiple antennas
• In MU-MIMO antennas at one of the ends of the
communication link are no longer co-located.

• BC is downlink MU-MIMO
channel.
1
User 1

2
• Lack of cooperation between Base
Station

the receivers. User r

t

• pre-coding is performed at
base station Figure: MU-MIMO Broadcast Channel.
 8

Methodology: DPC using TCQ/TCM

scheme
αS

-
k bits C1 n C2 m
Rate n/m PSK
Rate=k/n u x

Channel
(n-k) bits Code
H-1 (TCM)
w n bits

Source code (rate k/m TCQ)

Figure: TCQ/TCM based DPC implantation.

 9

Methodology: Code C1 (1)

• Rate ½ convolutional code with constraint length 3

Present State Next State

00 00 00
y1
11
0 i/p
i/p D D 1 i/p
01 11 01
y2 00
10
Figure: rate 1/2 code C1 of DPC encoder. 10
01
10

01

G  [1  D  D 2
1 D ] 2 11
10
11

Figure : Trellis diagram of code C1.

 10

Methodology: Code C1 (2)

• For Syndrome former and inverse syndrome
former of convolutional code
G HT  0 •G is generator matrix
•HT is Syndrome Former (SF)
(H 1 )T H T  1
•(H-1)T is inverse syndrome former

 1  D 2

y1 D D
H 
T
2
y1

y2 S 1  D  D 
(H 1 )T  1  D D 
D D S D y2

Figure: Syndrome Former Figure: Inverse

Syndrome Former
 11

Methodology: Code C2
• Rate 2/3 Trellis coded modulation (TCM)
Present Next
x1 y2 state 0 state

y1 00 4 00
2
6
x0 D D
2
y0 01 6
01
0 3

Figure: Rate 2/3 TCM for code C2 of 1

5
DPC encoder. 10
7
3 10

• Presence of uncoded bit

3

causes parallel transition in 11 1 11

the trellis structure of TCM

5

Figure: Trellis structure of code C2

 12

Methodology: Viterbi decoding

• It is maximum likelihood decoding algorithm
• Viterbi decoder is used to decode trellis code.

PPM

BMU ACS SMU

Figure: Viterbi decoder architecture.

 13

Methodology: DPC encoder (1)

Data bits = 01 Data bits = 10
State i/p = 0 State i/p = 0
0 0

1 1

2 2

y2 3 3

4 4
y1
State i/p
D D
5 5

D D 6 6

y0 7 7

Data input 8 8
d1
-1 Data bits
w H d2
9 9

10 10

Figure: Structure of DPC encoder based 11 11

on 16 state encoder TCQ/TCM. 12 12

13 13

14 14

15 15

Figure : Trellis diagram for

DPC encoder for state input
‘0’ and different data bits.
 14

Methodology: DPC encoder (2)

Interference sequence

State 0 BMU
8 - PSK

Programmable interconnection
ACS State 0
BMU
8 - PSK

BMU
8 - PSK

ACS State 15
BMU
8 - PSK

State 15

Data bits

Figure: Architecture of DPC encoder.

• Performs forward recursion on the trellis,

i.e. computing matrices along the trellis
 15

Methodology: DPC encoder (3)

• Once forward recursion is completed final output
sequence is obtained by trace back operation

Output of

Previous state generation unit

survivor path

Survivor
Data bits
memory

Current state

Figure: Architecture for the Trace-Back operation.

 16

Methodology: DPC encoder (4)

• MATLAB ‘cell array’ is used to implement
survivor memory.
• Each cell is a 3x1 array
Stages
(No. of symbols)

0 1
3x1 3x1 3x1
0 array array array

3x1 3x1 3x1

1
States

array array array

Path metric

Survivor path
3x1 3x1 3x1
15 array array array Data bits
Cell array
A Cell

Figure: Survivor memory Organization.

 17

Methodology: DPC decoder

Decoder
Y H W’
For C2

Figure: DPC decoder.

 18

Methodology: Implementation of DPC

for MU-MIMO (1)
W1'
User 1 data TCM u1 x1 y1 TCM decoder
w1 encoder (User 1)
z1

User 2 data DPC u2 Pre-coding x2 Channel y2 DPC decoder W2'

w2 encoder B H (User 2)
z2

User 3 data DPC u3 x3 y3 DPC decoder W3'

w3 encoder (User 3)
z3
Outer coder Inner coder

Transmitter Channel Receiver

Figure: MU-MIMO with base station having 3 antennas and 3

users each having single antenna.
 19

Methodology: Implementation of DPC

for MU-MIMO (2)
 b11 b12 b13   u1 
• Transmitted signal x  Bu  b21 b22 b23 .u2 
  
b31 b32 b33  u3 
 b11u1  b12u2  b13u3 
• Received signal  b21u1  b22u2  b23u3 
 
b31u1  b32u2  b33u3 
y  Hx
 h11 h12 h13   b11u1  b12u2  b13u3 
 h21 h22 h23 .b21u1  b22u2  b23u3 
  
h31 h32 h33  b31u1  b32u2  b33u3 
 h11 (b11u1  b12u2  b13u3 )  h12 (b21u1  b22u2  b23u3 )  h13 (b31u1  b32u2  b33u3 ) 
 h21 (b11u1  b12u2  b13u3 )  h22 (b21u1  b22u2  b23u3 )  h23 (b31u1  b32u2  b33u3 )
 
h31 (b11u1  b12u2  b13u3 )  h32 (b21u1  b22u2  b23u3 )  h33 (b31u1  b32u2  b33u3 ) 
 20

Methodology: Implementation of DPC

for MU-MIMO (3)
• Received signal can be simplified
For user 1
y1  (h11b11  h12b21  h13b31 )u1  (h11b12  h12b22  h13b32 )u2  (h11b13  h12b23  h13b33 )u3
  
required signal additive noise

For user 2
y2  (h21b11  h22b21  h23b31)u1  (h21b12  h22b22  h23b32 )u2  (h21b13  h22b23  h23b33)u3
    
known interferen ce required signal additive noise

For user 3
y3  (h31b11  h32b21  h33b31)u1  (h31b12  h32b22  h33b32 )u2  (h31b13  h32b23  h33b33)u3
  
known interferen ce required signal
 21

Methodology: Pre-coding matrix (1)

• Use LQ-decomposition of channel matrix.

H  LQ
• Select precoding matrix as BQ H

• Then y  Hx
 (LQ)(Q H u)
 LQQ H u ( QQH  I)
 Lu
 22

Methodology: Pre-coding matrix (2)

•So  y1  l11 0 0   u1 
 y   l l 0 .u2 
 2   21 22  
 y3  l31 l32 l33  u3 

and
y1  l11u1

required signal

y2  l21u1  l22u2
 
known interferen ce required signal

y3  l31u1  l32u2  l33u3

 
known interferen ce required signal
 23

RESULTS AND DISCUSSION (1)

Figure: Gain provided by using DPC.

 24

RESULTS AND DISCUSSION (2)

y2

y1
State i/p
D D

D D

y0

Data input d1
Data bits
w H-1 d2

Figure: 16-state DPC.

y2

u D D D D y1

D D
d1
w H-1 y0
d2

Figure: 64-state DPC.

Figure: Comparison of gain provided by 16-

state DPC and 64-state DPC.
 25

RESULTS AND DISCUSSION (3)

Total noise power can be

reduced by by subtracting
only partial interference, αS

PX SNR
 
PX  PZ SNR  1
Figure: SNR Vs BER of DPC with full
interference presubtraction and PIP.
 26

RESULTS AND DISCUSSION (4)

Figure: SNR vs BER curve for two users MU-MIMO BC.

 27

RESULTS AND DISCUSSION (5)

Figure: SNR vs BER curve for three user MU-MIMO BC.

 28

RESULTS AND DISCUSSION (6)

Figure: SNR vs BER curve for four user MU-MIMO BC.

 29

CONCLUSION
• DPC based on TCQ/TCM scheme is designed.
• DPC cancels the effect of interference that is known
to the encoder.
• Gain provided by DPC increases by using stronger
source code and channel code.
• DPC is implemented for MU-MIMO broadcast
system.
• In MU-MIMO BC, DPC presubtracts known inter-
user interference
• Precoding forces unknown inter-user interference
in MU-MIMO to zero.
 30

LIMITATION and FUTURE WORK

• This thesis considers MU-MIMO broadcast
channel with multiple receivers each having
single antenna and base station with number of
antennas equal to number of receivers.

• This thesis work can be extended to the MU-

MIMO broadcast system with each receiver
having multiple antennas.

• Performance can be evaluated when number of

antennas at base station is more or less than sum
of antennas on all user terminals.
 31

REFERENCES (1)
[1] M. Costa, "Writing on dirty paper," IEEE Transactions on Information
Theory, vol. 29, no. 3, pp. 439-441, May 1983.
[2] J. Chou, S. Pradhan, and K. Ramchandran, "Turbo coded trellis-based
constructions for data embedding: channel coding with side information,"
Proc. 35th Asilomar Conf. Signals, Syst., Computers, vol. 1, pp. 305 - 309,
Nov. 2001.
[3] M. Carrasco, "Design and implementation of multi-user MIMO precoding
algorithms," Department of Electronics and Computer Science, University of
Mondragon, P.hd. Thesis November 2011.
[4] R. Zamir, S. Shamai, and U. Erez, "Nested linear/lattice codes for
structured multiterminal binning," IEEE Trans. Inform. Theory, vol. 48, no.
6, pp. 1250–1276, June 2002.
[5] W. Yu, D. Varodayan, and J. Cioffi, "Trellis and convolutional precoding
for transmitter-based interference pre-subtraction," IEEE Trans. Commun.,
vol. 53, no. 7, pp. 1220–1230, July 2005.
[6] Y. Sun et al., "Nested Turbo Codes for the Costa Problem," IEEE
transaction on communications, vol. 56, no. 1, Jan. 2008.
[7] P. Bhagawat et al., "An FPGA Implementation of Dirty Paper Precoder,"
reviewed at the direction of IEEE Communications Society subject matter
experts for publication in the ICC 2007 proceedings., 2007.
 32

REFERENCES (2)
[8] G. Caire and S. Shamai, "On achievable Throughput of a Multiantenna
Gaussian Broadcast Channel," IEEE transaction on information theory, vol.
49, no. 7, pp. 1691-1706, July 2003.
[9] S. Pai and B. Rajan, "A Practical Dirty Paper Coding Applicable for
Broadcast Channel," Coding and Modulation Lab, Dept of ECE, Indian
Institute of Science,Bangalore, Jan 2010.
[10] Dabbagh and D. Love, "Precoding for Multiple Antenna Gaussian
Broadcast Channels With Successive Zero-Forcing.," IEEE transaction on
signal processing, vol. 55, no. 7, pp. 3837-3850, July 2007.
[11] G. Khani, S. Lasaulce, and J. Dumont, "About the performance of practical
dirty paper coding schemes in gaussina MIMO broadcast channels,".
[12] M. UPPAL, "Code design for multiple input multiple output broadcast
channels," Office of Graduate Studies of Texas A&M University, M. Sc.
Thesis August 2006.
[13] http://www. radio-electornics.com/MIMO Technology Tutorial.
[14] T. Li, "MIMO Broadcast Channel," WAND Lab, Department of Electrical
Engineering, University of Notre Dame, April 2002.
[15] M. Hong, "Analysis of the Bit Error Rate of Trellis-coded Modulation.,"
School of Electrical Engineering, Department of Signals and Systems,
Chalmers university of technology, M.Sc. Thesis 2002.
33