Date Added: Aug 2009
The authors propose a practical scheme for binary dirty-paper channels. By exploiting the concept of random binning instead of superposition coding, the complexity of the system is greatly reduced. For comparison, the existing approaches require one of the native codes to be of non-uniform a priori distribution, which is generally achieved by combining a symbol mapper and high-order-alphabet Low-Density Parity-Check (LDPC) codes. Using high-order alphabets increases significantly the complexity and the resulting method is not flexible for designing systems of practical channel parameters. In contrast, they propose to implement the random binning concept using only binary LDPC and binary convolutional codes.