Wyner-Ziv Coding over Broadcast Channel with Noncausal Channel Side Information only Known at Encoder

Abstract:

We consider the problem of transmitting common message over discrete memoryless broadcast channel (DM-BC) with noncausal discrete memoryless (DM) channel side information (CSI) only known at encoder. Nayak, etc. consider this problem and give a scheme combining Wyner-Ziv coding and Gelfand-Pinsker coding. The Gelfand-Pinsker's code is optimal for point-to-point communication with the encoder accessed to noncausal CSI. But Nair, etc., show that the straightforward extension of Gelfand-Pinsker's code to DM-BC with DM state is not optimal. In this paper, the inner bound of transmitting common message over DM-BC with noncausal DM-CSI only known at encoder is given. The proof of achievability uses Wyner-Ziv coding, Gelfand-Pinsker coding, superposition coding, Marton coding and indirect decoding.

• Periodical: Applied Mechanics and Materials (Volumes 58-60)
• Pages: 1572-1576
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.58-60.1572
• Online since: June 2011
• Authors: Da Jin Wang, Guang Da Xue, Gui Liang Yan
• Keywords: Channel Side Information, Gelfand-Pinsker Coding, Indirect Decoding, Marton Coding, Memoryless Broadcast Channel, Wyner-Ziv Coding

References

[1] E. Tuncel: Slepian-wolf coding over broadcast channels IEEE Trans. Inf. Theory, vol. 52, no. 4, p.1469–1482, (2006).

DOI: 10.1109/tit.2006.871609

[2] J. Nayak, E. Tuncel, and D. Gunduz: Wyner-ziv coding over broadcast channels in Proc. IEEE Information Theory Workshop ITW '08, 2008, p.179–183.

DOI: 10.1109/itw.2008.4578646

[3] J. Nayak, E. Tuncel, and D. Gunduz: Wyner-ziv coding over broadcast channels: Digital schemes IEEE Trans. Inf. Theory, vol. 56, no. 4, p.1782–1799, (2010).

DOI: 10.1109/tit.2010.2040891

[4] S. I. Gelfand and M. S. Pinsker: Coding for channel with random parameters Probl. Control Inf. Theory, vol. 9, p.439–441, (1980).

[5] C. Heegard and A. E. Gamal: On the capacity of computer memory with defects IEEE Trans. Inf. Theory, vol. 29, no. 5, p.731–739, (1983).

DOI: 10.1109/tit.1983.1056723

[6] M. Costa: Writing on dirty paper (corresp. ) IEEE Trans. Inf. Theory, vol. 29, no. 3, p.439–441, (1983).

DOI: 10.1109/tit.1983.1056659

[7] P. Piantanida and S. Shamai: Capacity of compound state-dependent channels with states known at the transmitter in Proc. IEEE Int. Symp. Information Theory ISIT 2009, 2009, p.1968–(1972).

DOI: 10.1109/isit.2009.5205682

[8] Y. -K. C. Chandra Nair, Abbas El Gamal: An achievability scheme for the compound channel with state noncausally available at the encoder (available online at ArXiv. org. ).

[9] N. Merhav and S. S. (Shitz): On joint source-channel coding for the wyner-ziv source and the gelfand-pinsker channel IEEE Trans. Inf. Theory, vol. 49, no. 11, p.2844–2855, Nov. (2003).

DOI: 10.1109/tit.2003.818410

[10] A. E. Gamal and Y. -H. Kim: Lecture notes on network information theory (available online at ArXiv. org. ).