Practical dirty paper coding with nested binary LDGM-LDPC codes

Authors:
Qingchuan Wang;Chen He
Affiliations:
Department of Electronic Engineering, Shanghai Jiao Tong University;Department of Electronic Engineering, Shanghai Jiao Tong University
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 4
Cited 0

Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory
Efficient encoding of low-density parity-check codes

IEEE Transactions on Information Theory
Capacity and lattice strategies for canceling known interference

IEEE Transactions on Information Theory
Superposition coding for side-information channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The superior shaping performance of low-density generation matrix (LDGM) codes makes them important in the design of capacity-approaching dirty paper coding (DPC) schemes. One possible LDGM-based DPC scheme is the nested LDGM-LDPC code proposed by Wainwright and Martinian, which has been shown to be capacity-achieving under optimal encoding and decoding. In this paper, considering the Gaussian DPC problem limited to a binary alphabet, we propose practical encoding and decoding algorithms for the nested LDGM-LDPC code utilizing ideas from the fast LDPC encoding algorithm to satisfy the parity constraints, and optimize the degree distributions of the code through density evolution. Simulation results show that the proposed scheme can indeed closely approach the alphabet-constrained DPC capacity.