1

Dirty Paper Code design based on nested lattice code

and

Performance analysis
By: Krishna Prasad Phelu (067/MSI/609) (102139)
Date: 13 November, 2011.

Presentation outlines
Background Problem definition

Motivation
Multi-terminal communication networks is one of the fields of interest nowadays.
Channel coding with the side information (CCSI)

Figure: channel coding with side information.

Motivation: CCSI
Capacity with side information (S) not known to both
encoder and decoder.

1 PX C log( ) 2 PS PZ
Capacity with S known to both encoder and decoder.

PX 1 C log( ) 2 PZ Costa[1] proved in 1983 with S known only to encoder PX 1 C log( ) 2 PZ

Objective
To research on the DPC (dirty paper code), a special case of CCSI.

To design DPC based on nested lattice code using TCM/TCQ scheme.

Problem definition

Figure: DPC channel.

1 n 2 Power constraint on X: X i PX n i 1 Noise: Z N (0, PZ )

Received signal, Y=X+S+Z.
S is not known at the decoder but known non-casually at encoder.

Problem definition Cont

Tx can not simply pre-subtract S from X.
Tx: X =X-S. Rx: Y = X + S + Z = X + Z

Direct pre-subtraction have sever power penalty.

power of X: E[X2]=PX+PS

PS can be much higher than PX

Tomlinson-Harashima Precoding (THP)

1D implementation of Dirty paper coding problem Mod- operation is performed on X=(X-S)
Tx: X mod =(X-S) mod .

X is limited to interval

If X [0, ) THP has no power penalty. Equivalent to scalar quantization

Figure: Power penalty due to direct pre-subtraction for same signal.

10

Dirty paper coding (DPC)

Consider an entire sequence of S for higher dimensional mod operation
Joint source and channel code design problem. Zamir et al [4] proposed a practical nested code scheme for joint source and channel code design. TCQ/TCM is used.

11

DPC using TCQ/TCM

PX PX PZ
Figure: DPC Encoder using TCQ/TCM scheme.

12

DPC using TCQ/TCM

C2 is the channel code (TCM)

Contd

C1 concatenated with C2 serves as a source code (TCQ)

TCQ uses Viterbi algorithm to quantize S to U

13

DPC using TCQ/TCM

Contd

Figure: DPC Decoder using TCQ/TCM.

H is syndrome former of code C1. We use the viterbi decoder for decoding code from C2

14

DPC using TCQ/TCM

Contd

Figure: A TCQ/TCM encoder (rate 1/2/3 encoder).

15

DPC using TCQ/TCM Contd

The trellis structure change depending on the data bits.
difference between the Viterbi algorithm and nested code

16

DPC using TCQ/TCM

using following sequential circuit.

Contd

SF and ISF of C1 can be designed and implemented

Figure: Syndrome former of code C1

Figure: ISF of code C1

H T [ D,1]T

( H 1 )T [0,1]

17

Figure: DPC system simulation using TCQ/TCM scheme.

18

Figure: DPC performance.

19

Figure: Capacity gain that can be achieved with DPC.

20

Recommendation
For better performance of DPC
Use convolutional codes with very high constraint
lengths TCQ/TTCM scheme Turbo-like TCQ/TTCM scheme

21

Conclussion
DPC is efficient interference pre-cancelation scheme at transmitter.
DPC can be used to achieve channel capacity limit, without power penalty in Multi-terminal communication networks (like MIMO). DPC can be designed using nested code scheme.

22

References:
[1] M. Costa, Writing on dirty paper, IEEE Transactions on Information Theory, vol. It-29, pp. 439-441, May 1983. [2] Y. Sun, Y. Yang, A. D. Liveris, V. Stankovic, and Z. Xiong, "NearCapacity Dirty- Paper Code Design: A Source-Channel Coding Approach", IEEE Transactions on Information Theory, vol. 55, no. 7, July 2009.
[3] Yong Sun, "Source-channel coding for robust image transmission and for dirty paper coding", Ph.D. dissertation, Oce of Graduate Studies of Texas A&M University, Dec 2005.

[4] R. Zamir, S. Shamai, and U. Erez, Nested linear/lattice codes for structured multiterminal binning, IEEE Trans. Inform. Theory, vol. 48, pp. 1250-1276, June 2002.
[5] J. Chou, S. Pradhan, and K. Ramchandran, Turbo coded trellis-based constructions for data embedding: channel coding with side information, in Proc. 35th Asilomar Conf. Signals, Systems and Computers, Pacic Grove, CA, November 2001, vol. 1, pp. 305309.

23

References:
[6] Y. Sun, M. Uppal, A. Liveris, S. Cheng, V. Stankovic, and Z. Xiong, Nested turbo codes for the Costa problem, IEEE Trans. Communications, Vol. 56, pp. 1- 12,Janaury 2008. [7] M. A. Uppal, " Code design for multiple-input multiple-output broadcast channel, MSc Thesis, Texas A&M University, August 2006. [8] P. Bhagawat, W. Wang, M. Uppal, G. Choi, Z. Xiong, M. Yeary and A. Harris, An FPGA Implementation of Dirty Paper Precoder, ICC 2007 proceeding. [9] W. Yu, D. Varodayan, and J. Ciof, Trellis and convolutional precoding for transmitter-based interference pre-subtraction, IEEE Trans. Commun., vol. 53, no. 7, pp. 12201230, Jul. 2005

[10] Zhenyu Tu, Jing Li, Blum, R.S., Compression of a Binary Source with Side Information Using Parallelly Concatenated Convolutional Codes, vol. 1 pp. 46-50, January 2005.
[11] www.wikipedia.com/ dirty paper coding.

24