• DocumentCode
    925
  • Title

    Communication With Disturbance Constraints

  • Author

    Bandemer, Bernd ; El Gamal, Abbas

  • Author_Institution
    Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
  • Volume
    60
  • Issue
    8
  • fYear
    2014
  • fDate
    Aug. 2014
  • Firstpage
    4488
  • Lastpage
    4502
  • Abstract
    Motivated by the broadcast view of the interference channel, the new problem of communication with disturbance constraints is formulated. The rate-disturbance region is established for the single constraint case and the optimal encoding scheme turns out to be the same as the Han-Kobayashi scheme for the two user-pair interference channel. This result is extended to the Gaussian vector (multiple-input and multiple-output) case. For the case of communication with two disturbance constraints, inner and outer bounds on the rate-disturbance region for a deterministic model are established. The inner bound is achieved by an encoding scheme that involves rate splitting, Marton coding, and superposition coding, and is shown to be optimal in several nontrivial cases. This encoding scheme can be readily applied to discrete memoryless interference channels and motivates a natural extension of the Han-Kobayashi scheme to more than two user pairs.
  • Keywords
    Gaussian processes; broadcast channels; encoding; radiofrequency interference; vectors; Gaussian vector case; Han-Kobayashi scheme; Marton coding; communication problem; deterministic model; discrete memoryless interference channels; disturbance constraints; multiple-input-and-multiple-output case; optimal encoding scheme; rate splitting; rate-disturbance region; superposition coding; user-pair interference channel; Encoding; Entropy; Interference channels; Noise; Receivers; Vectors; Zinc; Capacity with constraints; broadcast channel; interference channel; network information theory; wiretap channel;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2014.2322852
  • Filename
    6813663