A close-to-capacity dirty paper coding scheme

IEEE Transactions on Information Theory

Volumn 51, Issue 10, 2005, Pages 3417-3432

  Erez, Uri ^a,b   ten Brink, Stephan ^c  

^a Department of Electrical Engineering and Computer Science   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c Realtek Semiconductors   (United States)

Author keywords

Dirty paper coding; EXIT chart; Interference cancellation; Iterative decoding; Minimum mean squared error (MMSE) estimation; Mutual information; Repeat accumulate (RA) codes; Vector quantization

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ENCODING (SYMBOLS); ESTIMATION; INTERFERENCE SUPPRESSION; ITERATIVE METHODS; SIGNAL ENCODING; SIGNAL TO NOISE RATIO; TRANSMITTERS; TURBO CODES; VECTOR QUANTIZATION;

DIRTY PAPER CODING; EXIT CHART; ITERATIVE DECODING; MINIMUM MEAN SQUARED ERROR (MMSE) ESTIMATION; MUTUAL INFORMATION; REPEAT-ACCUMULATE (RA) CODES;

INFORMATION THEORY;

EID: 26844530579     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.855586     Document Type: Article

References (34)

1. U. Erez, S. Shamai (Shitz), and R. Zamir, "Capacity and lattice strategies for cancelling known interference," in Proc. Int. Symp. Information Theory and Its Applications (ISITA), Honolulu, HI, Nov. 2000, pp. 681-684.
2. M. H. M. Costa, "Writing on dirty paper," IEEE Trans. Inf. Theory, vol. IT-29, no. 3, pp. 439-441, May 1983.
3. S. I. Gelfand and M. S. Pinsker, "Coding for channel with random parameters" (in Russian), Probl. Pered. Inform. (Probl. Inf. Transm.), vol. 9, no. 1, pp. 19-31, 1980.
4. F. M. J. Willems, "On Gaussian channels with side information at the transmitter," in Proc. 9th Symp. Information Theory in the Benelux, Enschede, The Netherlands, 1988.
5. P. Moulin and J. O'Sullivan, "Information-theoretic analysis of information hiding," Proc. IEEE Int. Symp. Information Theory (ISIT), p. 19, Jun. 2000.
6. B. Chen and G. W. Wornell, "Quantization index modulation: A class of provably good methods for digital watermarking and information embedding," in Proc. IEEE Int. Symp. Information Theory (ISIT), Sorrento, Italy, Jun. 2000, p. 46.
7. J. J. Eggers, J. K. Su, and B. Girod, "A blind watermarking scheme based on structured codebooks," in Proc. IEE Colloquium: Secure Images and Image Authentication, London, U.K., Apr. 2000, pp. 4/1-4/6.
8. G. Caire and S. Shamai (Shitz), "On the achievable throughput of a multi-antenna Gaussian broadcast channel," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1649-1706, Jul. 2003.
9. T. Philosof, U. Erez, and R. Zamir, "Combined shaping and precoding for interference cancellation at low SNR," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 68.
10. G. D. Forney Jr., "Trellis shaping," IEEE Trans. Inf. Theory, vol. 38, no. 2, pp. 281-300, Mar. 1992.
11. M. V. Eyuboglu and G. D. Forney Jr., "Trellis precoding: Combined coding, precoding and shaping for intersymbol interference channels," IEEE Trans. Inf. Theory, vol. 38, no. 2, pp. 301-314, Mar. 1992.
12. R. F. Fischer, C. Windpassinger, and J. B. Huber, "Modulo-lattice reduction in precoding schemes," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 163.
13. G. D. Forney Jr., "On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener," presented at the 41st Allerton Conf. on Communication, Control, and Computing, Monticello, IL, Oct. 2003.
14. G. D. Forney Jr., "Coset codes-I: Introduction and geometrical classification," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 1123-1151, Sep. 1988.
15. R. Zamir and M. Feder, "On lattice quantization noise," IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1152-1159, Jul. 1996.
16. M. Tomlinson, "New automatic equalizer employing modulo arithmetic," Electron. Lett., vol. 7, pp. 138-139, Mar. 1971.
17. H. Harashima and H. Miyakawa, "Matched-transmision technique for channels with intersymbol interference," IEEE Trans. Commun., vol. COM-20, no. 8, pp. 774-780, Aug. 1972.
18. R. D. Wesel and J. M. Cioffi, "Achievable rates for Tomlinson-Harashima precoding," IEEE Trans. Inf. Theory, vol. 44, no. 2, pp. 824-830, Mar. 1998.
19. A. R. Calderbank and L. H. Ozarow, "Nonequiprobable signaling on the Gaussian channel," IEEE Trans. Inf. Theory, vol. 36, no. 4, pp. 726-740, Jul. 1990.
20. G. Caire and S. Shamai, "Writing on dirty tape with LDPC codes," in Proc. DIMACS Workshop on Signal Processing for Wireless Transmission. Piscataway, NJ, Oct. 7-9, 2002.
21. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Communications (ICC), Geneva, Switzerland, May 1993, pp. 1064-1070.
22. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996.
23. U. Erez and R. Zamir, "Achieving 1/2 log(1 + SNR) on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2293-2314, Oct. 2004.
24. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups. New York: Springer-Verlag, 1988.
25. G. D. Forney Jr., "Multidimensional constellations-Part II: Voronoi constellations," IEEE J. Sel. Areas in Commun., vol. 7, no. 6, pp. 941-958, Aug. 1989.
26. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inf. Theory, vol. IT-20, no. 2, pp. 284-287, Mar. 1974.
27. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2000, pp. 1-8.
28. S. ten Brink and G. Kramer, "Design of repeat-accumulate codes for iterative detection and decoding," in IEEE Trans. Signal Process., vol. 51, Nov. 2003, pp. 2764-2772.
29. S. ten Brink, "Exploiting the chain rule of mutual information for the design of iterative decoding schemes," presented at the 39th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, Oct. 2001.
30. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: Model and erasure channel properties," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2657-2673, Nov. 2004.
31. M. Tüchler and J. Hagenauer, "EXIT charts and irregular codes," in Proc. 36th Ann. Conf. Information Science and Systems, Princeton, NJ, Mar. 2002.
32. H. D. Pfister and P. H. Siegel, "Joint iterative decoding of LDPC codes and channels with memory," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 15-18.
33. S. ten Brink, "Designing iterative decoding schemes with the extrinsic information transfer chart," AEÜ Int. J. Electron. Commun., vol. 54, no. 6, pp. 389-398, Nov. 2000.
34. P. Moulin, A. K. Goteti, and R. Kötter, "Optimal sparse-QIM codes for zero-rate blind watermarking," in Proc. Int. Conf. Accoustics, Speech, and Signal Processing, vol. 3, Montreal, QC, Canada, 2004, pp. 73-76.