Superposition coding for side-information channels

IEEE Transactions on Information Theory

Volumn 52, Issue 5, 2006, Pages 1872-1889

  Bennatan, Amir ^a   Burshtein, David ^a   Caire, Giuseppe ^b,c   Shamai, Shlomo ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b EURECOM   (France)

^c University of Southern California ^*  (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Dirty paper; Dirty tape; Multiple access channel (MAC); Side information; Superposition coding

Indexed keywords

COMPUTER SIMULATION; GAUSSIAN NOISE (ELECTRONIC); MAXIMUM LIKELIHOOD ESTIMATION; RANDOM PROCESSES; SIGNAL ENCODING;

DIRTY PAPER; DIRTY TAPE; MULTIPLE-ACCESS CHANNEL; SIDE INFORMATION; SUPERPOSITION CODING;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (54)

1. A. Amraoui, S. Dusad, and R. Urbanke, "Achieving general points in the 2-user Gaussian MAC without time-sharing or rate-splitting by means of iterative coding," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 334.
2. L. R. 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.
3. R. J. Barron, B. Chen, and G. W. Wornell, "On the duality between information embedding and source coding with side information and some applications," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 300.
4. A. Bennatan and D. Burshtein, "On the application of LDPC codes to arbitrary discrete-memoryless channels," IEEE Trans. Inf. Theory, vol. 50, no. 3, pp. 417-438, Mar. 2004.
5. A. Bennatan and D. Burshtein, "Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 549-583, Feb. 2006.
6. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
7. R. S. Blum, Z. Tu, and J. Li, "How optimal is algebraic binning approach: A case study of the turbo-binning scheme with uniform and nonuniform sources," in Proc. 38th Annu. Conf. Information Sciences and System, Princeton, NJ, Mar. 14-19, 2004.
8. J. Boutros and G. Caire, "Iterative multiuser joint decoding: United framework and asymptotic analysis," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1772-1793, Jul. 2002.
9. G. Caire, D. Burshtein, and S. Shamai, "LDPC coding for interference mitigation at the transmitter," in Proc. 40th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2002, pp. 217-226.
10. G. Caire, R. R. Müller, and T. Tanaka, "Iterative multiuser joint decoding: Optimal power allocation and low-complexity implementation," IEEE Trans. Inf. Theory, vol. 50, no. 9, pp. 1950-1973, Sep. 2004.
11. G. Caire and S. Shamai (Shitz), "On the achievable throughput of a multiantenna Gaussian broadcast channel," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1691-1706, Jul. 2003.
12. G. Caire, A. Bennatan, D. Burshtein, and S. Shamai, "Coding schemes for the binary-symmertic channel with known interference," in Proc. 41st Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2003, pp. 809-818.
13. N. Chayat and S. Shamai, "Convergence properties of iterative soft onion peeling," in Proc. IEE Information Theory and Communications Workshop, Kruger National Park, South Africa, Jun. 1999, pp. 9-11.
14. B. Chen and G. W. Wornell, "Achievable performance of digital water-marking systems," in Proc. IEEE Int. Conf. Multimedia Computing and Systems, vol. 1, Florence, Italy, Jun. 1999, pp. 13-18.
15. S.-Y. Chung, J. G. D. Forney, T. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, no. 2, pp. 58-60, Feb. 2001.
16. A. S. Cohen and A. Lapidoth, "The Gaussian watermarking game," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1639-1667, Jun. 2002.
17. M. Costa, "Writing on dirty paper," IEEE Trans. Inf. Theory, vol. IT-29, no. 3, pp. 439-441, May 1983.
18. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
19. I. J. Cox, M. L. Miller, and A. L. McKellips, "Watermarking as communications with side information," Proc. IEEE (Special Issue on Identification and Protection of Multimedia Information), vol. 87, no. 7, pp. 1127-1141, Jul. 1999.
20. R. Dobrushin, "Asymptotic optimality of group and systematic codes for some channels," Theor. Probab. Appl., vol. 8, pp. 52-66, 1963.
21. U. Erez, S. Shamai (Shitz), and R. Zamir, "Capacity and lattice-strategies for cancelling known interference," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3820-3833, Nov. 2005.
22. U. Erez, S. Litsyn, and R. Zamir, "Lattices which are good for (almost) everything," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3401-3416, Oct. 2005, submitted for publication.
23. U. Erez and S. ten Brink, "A close-to-capacity dirty paper coding scheme," IEEE Trans. Inform. Theory, vol. 51, no. 10, pp. 3417-3432, Oct. 2005.
24. U. Erez and R. Zamir, "Lattice decoding can achieve 1/2 log (1+SNR) on the AWGN channel using nested codes," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 125.
25. R. F. H. Fischer, R. Tzschoppe, and R. Bauml, "Lattice costa scheme using subspace projection for digital watermarking," Europ. Trans. Telecommunications, vol. 15, no. 4, pp. 351-361, Jul./Aug. 2004.
26. G. D. Forney Jr and G. Ungerboeck, "Modulation and coding for linear Gaussian channels," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2384-2415, Oct. 1998.
27. C. Fragouli, R. D. Wesel, D. Sommer, and G. Fettweis, "Turbo codes with nonuniform QAM constellations," in Proc. IEEE Int. Conf. Communications, vol. 1, Helsinki, Finland, Jun. 2001, pp. 70-73.
28. P. Frenger, P. Orten, T. Ottosson, and A. Svensson, "Multirate Convolutional Codes," Dept. Signals and Systems, Communication Systems Group, Chalmers Univ. Technology, Goteborg, Sweden, Tech. Rep. 21, 1998.
29. S. Gel'fand and M. Pinsker, "Coding for channel with random parameters," Probl. Contr. Inf. Theory, vol. 9, no. 1, pp. 19-31, Jan. 1980.
30. D. Hoesli, "On the capacity per unit cost of the dirty tape channel," presented at the Winter School on Coding and Information Theory, Monte Verita, Switzerland, 2003.
31. 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.
32. A. Kusnetsov and B. Tsybakov, "Coding in a memory with defective cells," Probl. Pered. Inform., vol. 10, no. 2, pp. 52-60, 1974.
33. A. Lapidoth, "Mismatched encoding in rate distortion theory," in Proc. 1994 IEEE-IMS Workshop on Information Theory and Statistics, Alexandria, VA, Oct. 1994, pp. 67-67.
34. S.-C. Lin and H.-J. Su, "Vector superposition dirty paper coding for MIMO Gaussian braodcast channels," in Proc. 2005 Conf. Information Sciences and Systems, The Johns Hopkins Univ., Baltimore, MD, Mar. 2005.
35. T. Liu and P. Viswanath, "Opportunistic orthogonal writing on dirty paper," IEEE Trans. Inf. Theory, submitted for publication.
36. P. Moulin and J. A. O'Sullivan, "Information-theoretic analysis of information hiding," IEEE Trans. Inf. Theory, vol. 49, no. 3, pp. 563-593, Mar. 2003.
37. T. Philosof, "Precoding for interference cancellation at low SNR," M.Sc. thesis, Tel-Aviv Univ., Tel-Aviv, Israel, 2003.
38. T. Philosof, U. Erez, and R. Zamir, "Combined shaping and precoding for interference cancellation at low SNR," in Proc. 2003 Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 68.
39. S. Pradhan, J. Chou, and K. Ramchandran, "Duality between source coding and channel coding and its extension to the side information case," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1181-1203, May 2003.
40. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
41. P. Robertson and T. Wörts, "Bandwidth-efficient turbo trellis-coded modulation using punctured component codes," IEEE J. Select. Areas Commun., vol. 16, no. 2, pp. 206-218, Feb. 1998.
42. A. Sanderovich, M. Peleg, and S. Shamai, "LDPC coded MIMO multiple access communications," in Proc. 2004 Int. Zurich Seminar on Communications, ETH, Zurich, Switzerland, Feb. 2004, pp. 106-110.
43. C. Shannon, "Channels with side information at the transmitter," IBM J. Res. Devel., pp. 289-293, 1958.
44. F.-W. Sun and H. C. A. van Tilborg, "Approaching capacity by equiprobable signaling on the Gaussian channel," IEEE Trans. Inf. Theory, vol. 39, no. 5, pp. 1714-1716, Sep. 1993.
45. Y. Sun, A. D. Liveris, V. Stankovic, and Z. Xiong, "Near-capacity dirty-paper code design: A source-channel coding approach," in Proc. 2005 Conf. Information Sciences and Systems, The Johns Hopkins Univ., Baltimore, MD, Mar. 2005.
46. I. E. Telatar, "Capacity of multi-antenna Gaussian channels," Europ. Trans. Telecommun., vol. 10, no. 6, pp. 585-596, Nov. 1999.
47. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. Commun., vol. 52, no. 4, pp. 670-678, Apr. 2004.
48. G. Ungerboeck, "Channel coding with multilevel/phase signals," IEEE Trans. Inf. Theory, vol. IT-28, no. 1, pp. 55-67, Jan. 1982.
49. S. Verdú, "On channel capacity per unit cost," IEEE Trans. Inf. Theory, vol. 36, no. 5, pp. 1019-1030, Sep. 1990.
50. S. Vishwanath, N. Jindal, and A. Goldsmith, "Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2658-2668, Oct. 2003.
51. H. Wang and P. Viswanath, "Fixed binning schemes for channel and source coding problems an operational duality," in Proc. 38th Annu. Conf. Information Sciences and System, Princeton, N.J, Mar. 2004.
52. H. Weingarten, Y. Steinberg, and S. Shamai (Shitz), "The capacity region of the Gaussian MIMO broadcast channel," in Proc. 38th Annu. Conf. Information Sciences and System, Princeton, N.J., USA, Mar. 2004.
53. A. D. Wyner, "Recent results in the Shannon theory," IEEE Trans. Inf. Theory, vol. IT-20, no. 1, pp. 2-10, Jan. 1974.
54. R. Zamir, S. Shamai (Shitz), and U. Erez, "Nested linear/lattice codes for structured multiterminal binning," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1250-1276, Jun. 2002.