Channel Code Design with Causal Side Information at the Encoder

The problem of channel code design for the M-ary input AWGN channel with additive discrete interference where the sequence of i.i.d. interference symbols is known causally at the encoder is considered. The code design criterion at high SNR is derived by defining a new distance measure between the input symbols of the Shannon's associated channel. For the case of binary-input channel, it is shown that it is sufficient to use only two symbols of the associated channel in the encoding as long as the distance spectrum of the code is concerned. This reduces the problem of code design for the binary-input AWGN channel with known interference to the design of binary codes for the AWGN channel with maximum Hamming distance.

[1]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[2]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[3]  Wei Yu,et al.  Sum capacity of Gaussian vector broadcast channels , 2004, IEEE Transactions on Information Theory.

[4]  Andrea J. Goldsmith,et al.  Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.

[5]  Shlomo Shamai,et al.  Writing on dirty tape with LDPC codes , 2003, Multiantenna Channels: Capacity, Coding and Signal Processing.

[6]  M. Tomlinson.  New automatic equaliser employing modulo arithmetic , 1971 .

[7]  Gregory W. Wornell,et al.  Quantization index modulation: A class of provably good methods for digital watermarking and information embedding , 2001, IEEE Trans. Inf. Theory.

[8]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[9]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[10]  Young-Joon Kim,et al.  Cross Correlation of Sidel'nikov Sequences and Their Constant Multiples , 2007, IEEE Transactions on Information Theory.

[11]  David Tse,et al.  Sum capacity of the multiple antenna Gaussian broadcast channel , 2002, Proceedings IEEE International Symposium on Information Theory,.

[12]  Amir K. Khandani,et al.  Precoding for the AWGN Channel With Discrete Interference , 2009, IEEE Transactions on Information Theory.

[13]  L. Khachiyan,et al.  The polynomial solvability of convex quadratic programming , 1980 .

[14]  Shlomo Shamai,et al.  Capacity and lattice strategies for canceling known interference , 2005, IEEE Transactions on Information Theory.

[15]  David Tse,et al.  Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality , 2003, IEEE Trans. Inf. Theory.

[16]  Claude E. Shannon,et al.  Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..

[17]  Stephan ten Brink,et al.  A close-to-capacity dirty paper coding scheme , 2004, IEEE Transactions on Information Theory.

[18]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[19]  Wei Yu,et al.  Trellis and convolutional precoding for transmitter-based interference presubtraction , 2005, IEEE Transactions on Communications.

[20]  Shlomo Shamai,et al.  Superposition coding for side-information channels , 2006, IEEE Transactions on Information Theory.

[21]  Shlomo Shamai,et al.  The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel , 2006, IEEE Transactions on Information Theory.

[22]  Shlomo Shamai,et al.  On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.