LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Li, Min; Simeone, Osvaldo; Yener, Aylin (2010)
Languages: English
Types: Preprint
Subjects: Computer Science - Information Theory

Classified by OpenAIRE into

arxiv: Computer Science::Information Theory
ACM Ref: Data_CODINGANDINFORMATIONTHEORY
It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that the capacity region of a two-user MAC with independent states, each known strictly causally to one encoder, can be enlarged by letting the encoders send compressed past state information to the decoder. In this work, a generalization of the said strategy is proposed whereby the encoders compress also the past transmitted codewords along with the past state sequences. The proposed scheme uses a combination of long-message encoding, compression of the past state sequences and codewords without binning, and joint decoding over all transmission blocks. The proposed strategy has been recently shown by Lapidoth and Steinberg to strictly improve upon the original one. Capacity results are then derived for a class of channels that include two-user modulo-additive state-dependent MACs. Moreover, the proposed scheme is extended to state-dependent MACs with an arbitrary number of users. Finally, output feedback is introduced and an example is provided to illustrate the interplay between feedback and availability of strictly causal state information in enlarging the capacity region.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] S. Haykin, “Cognitive radio: brain-empowered wireless communications,” IEEE Journal on Selected Areas in Communications, vol. 23, no. 2, pp. 201-220, Feburary 2005.
    • [2] N. Devroye, P. Mitran, and V. Tarokh, “Achievable rates in cognitive radio channels,” IEEE Transactions on Information Theory, vol. 52, no. 5, pp. 1813-1827, May 2006.
    • [3] S. Jafar, S. Srinivasa, I. Maric, and A. Goldsmith, “Breaking spectrum gridlock with cognitive radios: an information theoretic perspective,” Proceedings of the IEEE, vol. 97, no. 5, pp. 894-914, May 2009.
    • [4] C. E. Shannon, “The zero error capacity of a noisy channel,” IRE Transactions on Information Theory, vol. 2, no. 3, pp. 8-19, 1956.
    • [5] --, “Channels with side information at the transmitter,” IBM Journal of Research and Development, vol. 2, no. 4, pp. 289-293, October 1958.
    • [6] S. GelFand and M. S. Pinsker, “Coding for channel with random parameters,” Problems of Control and Information Theory, vol. 9, no. 1, pp. 19-31, 1980.
    • [7] M. Costa and A. El Gamal, “The capacity region of the discrete memoryless interference channel with strong interference,” IEEE Transactions on Information Theory, vol. 33, no. 5, pp. 710-711, September 1987.
    • [8] G. Keshet, Y. Steinberg, and N. Merhav, “Channel coding in the presence of side information,” Foundations and Trends in Communications and Information Theory, vol. 4, no. 6, pp. 445-586, 2007.
    • [9] S. Sigurjonsson and Y. H. Kim, “On multiple user channels with state information at the transmitters,” in Proceedings of IEEE International Symposium on Information Theory, September 2005.
    • [10] S. Jafar, “Capacity with causal and noncausal side information: A unified view,” IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5468-5474, December 2006.
    • [11] A. Somekh-Baruch, S. Shamai, and S. Verdu, “Cooperative multiple-access encoding with states available at one transmitter,” IEEE Transactions on Information Theory, vol. 54, no. 10, pp. 4448-4469, October 2008.
    • [12] S. P. Kotagiri and J. N. Laneman, “Multiaccess channels with state known to some encoders and independent messages,” EURASIP Journal on Wireless Communications and Networking, vol. 2008, pp. 1-14, January 2008.
    • [13] T. Philosof, A. Khisti, U. Erez, and R. Zamir, “Lattice strategies for the dirty multiple access channel,” in Proceedings of IEEE International Symposium on Information Theory, June 2007.
    • [14] T. Philosof and R. Zamir, “The rate loss of single-letter characterization: the ”Dirty” multiple access channel,” 2008, available online at http://arxiv.org/abs/0803.1120.
    • [15] A. Lapidoth and Y. Steinberg, “The multiple access channel with causal and strictly causal side information at the encoders,” in Proceedings of International Zurich Seminar on Communications, March 2010.
    • [16] --, “The multiple access channel with two independent states each known causally to one encoder,” in Proceedings of IEEE International Symposium on Information Theory, June 2010.
    • [17] S. H. Lim, Y. H. Kim, A. El Gamal, and S. Y. Chung, “Noisy network coding,” 2010, available online at http://arxiv.org/abs/1002.3188v2.
    • [18] L. Ozarow, “The capacity of the white Gaussian multiple access channel with feedback,” IEEE Transactions on Information Theory, vol. 30, no. 4, pp. 623-629, July 1984.
    • [19] H. Permuter, S. Shamai, and A. Somekh-Baruch, “Message and state cooperation in multiple access channels,” 2010, available online at http://arxiv.org/abs/1006.2022.
    • [20] S. Verdu, “On channel capacity per unit cost,” IEEE Transactions on Information Theory, vol. 36, no. 5, pp. 1019-1030, September 2002.
    • [21] M. Gastpar, “The Wyner-Ziv problem with multiple sources,” IEEE Transactions on Information Theory, vol. 50, no. 11, pp. 2762-2768, November 2004.
    • [22] A. El Gamal and Y. H. Kim, “Lecture notes on network information theory,” 2010, available online at http://arxiv.org/abs/1001.3404.
    • [23] T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley-Interscience, July 2006.
    • [24] J. M. Ooi and G. W. Wornell, “Fast iterative coding techniques for feedback channels,” IEEE Transactions on Information Theory, vol. 44, no. 7, pp. 2960-2976, November 1998.
    • [25] D. Slepian and J. K. Wolf, “A coding theorem for multiple access channels with correlated sources,” The Bell System Technical Journal, vol. 52, no. 7, pp. 1037-1076, 1973.
    • [26] T. M. Cover and C. Leung, “An achievable rate region for the multiple-access channel with feedback,” IEEE Transactions on Information Theory, vol. 27, no. 3, pp. 292-298, May 1981.
    • [27] F. Willems, “The feedback capacity region of a class of discrete memoryless multiple access channels,” IEEE Transactions on Information Theory, vol. 28, no. 1, pp. 93-95, January 1982.
    • [28] J. Schalkwijk and T. Kailath, “A coding scheme for additive noise channels with feedback-I: No bandwidth constraint,” IEEE Transactions on Information Theory, vol. 12, no. 2, pp. 172 - 182, April 1966.
    • [29] K. De Bruyn, V. V. Prelov, and E. C. van der Meulen, “Reliable transmission of two correlated sources over an asymmetric multiple-access channel,” IEEE Transactions on Information Theory, vol. 33, no. 5, pp. 716-718, September 1987.
  • No related research data.
  • Discovered through pilot similarity algorithms. Send us your feedback.

Share - Bookmark

Funded by projects

  • NSF | Collaborative Research: CT-...
  • NSF | CIF: NeTS:Small:Collaborati...
  • NSF | CIF: Medium: Collaborative ...

Cite this article

Collected from