publication . Conference object . Preprint . 2016

on the capacity of the dirty paper channel with fast fading and discrete channel states

Rini, Stefano; Shitz, Shlomo Shamai;
Open Access
  • Published: 05 Feb 2016
  • Publisher: IEEE
Interference pre-cancellation as in the “writing onto dirty paper” channel crucially depends on the transmitter having exact knowledge of the way in which input and channel state combine to produce the channel output. The presence of even a small amount of uncertainty in such knowledge, gravely hampers the ability of the encoder to pre-code its transmissions against the channel state. This is particularly disappointing as it implies that interference pre-coding in practical systems is effective only when the channel estimates have very high precision, a condition which is generally unattainable in wireless environments. In this paper we show that state decoding,...
arXiv: Computer Science::Information Theory
ACM Computing Classification System: Data_CODINGANDINFORMATIONTHEORY
free text keywords: Telecommunications, business.industry, business, Binary erasure channel, Channel state information, Decoding methods, Precoding, Discrete mathematics, Computer science, Fading distribution, Communication channel, Channel capacity, Algorithm, Fading, Computer Science - Information Theory

[1] H. Harashima and H. Miyakawa, “Matched-transmission technique for channels with intersymbol interference,” Communications, IEEE Transactions on, vol. 20, no. 4, pp. 774-780, 1972. [OpenAIRE]

[2] M. Tomlinson, “New automatic equaliser employing modulo arithmetic,” Electronics letters, vol. 7, no. 5, pp. 138-139, 1971. [OpenAIRE]

[3] Y. Sun, Y. Yang, A. D. Liveris, V. Stankovic´, and Z. Xiong, “Nearcapacity dirty-paper code design: A source-channel coding approach,” Information Theory, IEEE Transactions on, vol. 55, no. 7, pp. 3013- 3031, 2009.

[4] O. Simeone, E. Erkip, and S. Shamai, “On exploiting the interference structure for reliable communications,” in Information Sciences and Systems (CISS), 2010 44th Annual Conference on. IEEE, 2010, pp. 1-6.

[5] S. Gel'fand and M. Pinsker, “Coding for channel with random parameters,” Probl. Contr. Inform. Theory, vol. 9, no. 1, pp. 19-31, 1980.

[6] W. Zhang, S. Kotagiri, and J. N. Laneman, “Writing on dirty paper with resizing and its application to quasi-static fading broadcast channels,” in Information Theory, 2007. ISIT 2007. IEEE International Symposium on. IEEE, 2007, pp. 381-385.

[7] S. Rini and S. Shamai, “The impact of phase fading on the dirty paper channel,” arXiv preprint arXiv:1401.4236, 2014. [OpenAIRE]

[8] A. Khisti, U. Erez, A. Lapidoth, and G. Wornell, “Carbon copying onto dirty paper,” IEEE Trans. Inf. Theory, vol. 53, no. 5, pp. 1814-1827, May 2007.

[9] S. Rini and S. Shamai, “On capacity of the dirty paper channel with fading dirt in the strong fading regime,” in Information Theory Workshop (ITW), 2014 IEEE. IEEE, 2014, pp. 561-565. [OpenAIRE]

[10] Y.-H. Kim, A. Sutivong, and T. M. Cover, “State amplification,” Information Theory, IEEE Transactions on, vol. 54, no. 5, pp. 1850-1859, 2008.

[11] A. G. Davoodi and S. A. Jafar, “Aligned image sets under channel uncertainty: Settling a conjecture by lapidoth, shamai and wigger on the collapse of degrees of freedom under finite precision CSIT,” CoRR, vol. abs/1403.1541, 2014. [Online]. Available: [OpenAIRE]

[12] G. Bresler and D. Tse, “The two-user Gaussian interference channel: a deterministic view,” Draft of version in Euro. Trans. Telecomm., Volume 19, Issue 4, pp. 333-354, June 2008, 2008.

[13] R. Zamir, “Anti-structure problems,” in International Zurich Seminar on Communications, 2012, p. 91.

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Conference object . Preprint . 2016

on the capacity of the dirty paper channel with fast fading and discrete channel states

Rini, Stefano; Shitz, Shlomo Shamai;