A practical dirty paper coding scheme based on LDPC codes

Abstract

In this paper, we present a practical Dirty Paper Coding (DPC) scheme using sum codes based on LDPC codes. While a typical sum-code-based DPC scheme uses a constrained decoder as part of the encoding operation, such an approach fails in the case of LDPC codes since the constrained decoder based on a standard LDPC decoder tends to get stuck at highly suboptimal points in typical scenarios. We get around this difficulty via a simple code construction method based on bit-mapping or permutation. Examples included in this paper show that compared to standard communication schemes the proposed DPC scheme yields substantial savings in terms of the transmit energy required to attain desired error performance.