Practical dirty paper coding with nested binary LDGM-LDPC codes

IEEE International Conference on Communications

Volumn , Issue , 2009, Pages

  Wang, Qingchuan ^a   He, Chen ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ALPHABETS; DEGREE DISTRIBUTIONS; DENSITY EVOLUTION; DIRTY PAPER CODING; ENCODING ALGORITHMS; ENCODING AND DECODING; GAUSSIANS; LDPC CODES; MATRIX; OPTIMAL ENCODING; PARITY CONSTRAINT; SIMULATION RESULT;

CODING ERRORS; ENCODING (SYMBOLS); EVOLUTIONARY ALGORITHMS;

DECODING;

EID: 70449507475     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2009.5199355     Document Type: Conference Paper

References (14)

1. M. H. M. Costa, "Writing on dirty paper," IEEE Trans. Inf. Theory, vol. 29, no. 3, pp. 439-441, May 1983.
2. U. Erez, S. Shamai, and R. Zamir, "Capacity and lattice strategies for canceling known interference," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3820-3833, Nov. 2005.
3. A. Bennatan, D. Burshtein, G. Caire, and S. Shamai, "Superposition coding for side-information channels," IEEE Trans. Inf. Theory, vol. 52, no. 5, pp. 1872-1889, May 2006.
4. Y. Sun, A. D. Liveris, V. Stankovic, and Z. Xiong, "Near-capacity dirty-paper code designs based on TCQ and IRA codes," in Proc. ISIT 2005, Aug. 2005, pp. 184-188.
5. E. Martinian and J. S. Yedidia, "Iterative quantization using codes on graphs," in Proc. 41st Annual Allerton Conf., Aug. 2004, arXiv:cs.IT/0408008.
6. E. Martinian and M. J. Wainwright, "Analysis of LDGM and compound codes for lossy compression and binning," in Workshop on Information Theory and its Applications, Feb. 2006, arXiv:cs.IT/0602046.
7. M. J. Wainwright and E. Maneva, "Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes," in Proc. ISIT 2005, Aug. 2005, pp. 1493-1497, arXiv:cs.IT/0508068.
8. T. Filler and J. Fridrich, "Binary quantization using Belief Propagation with decimation over factor graphs of LDGM codes," in Proc. 45th Annual Allerton Conf., Oct. 2007, arXiv:0710.0192v1 [cs.IT].
9. Q. C. Wang and C. He, "Approaching 1.53-dB shaping gain with LDGM quantization codes," in Proc. GLOBECOM 2007, Washington, DC, Nov. 2007.
10. Q. Wang and C. He, "Design and analysis of LDGM-based codes for MSE quantization," Jan. 2008, submitted for publication, available from arXiv:0801.2423v1 [cs.IT].
11. V. Chandar, E. Martinian, and G. W. Wornell, "Information embedding codes on graphs with iterative encoding and decoding," in Proc. ISIT 2006, Jul. 2006, pp. 866-870.
12. M. J. Wainwright and E. Martinian, "Low-density graph codes that are optimal for source/channel coding and binning," Apr. 2007, arXiv:0704.1818.
13. F. R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
14. T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.