Multiple Access Channels with States Causally Known at Transmitters

Preprint English OPEN
Li, Min ; Simeone, Osvaldo ; Yener, Aylin (2010)
  • Related identifiers: doi: 10.1109/TIT.2012.2229459
  • Subject: Computer Science - Information Theory
    arxiv: Computer Science::Information Theory
    acm: 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.
  • References (29)
    29 references, page 1 of 3

    [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.

  • Similar Research Results (1)
  • Metrics
    1
    views in OpenAIRE
    0
    views in local repository
    0
    downloads in local repository