Capacity characterization for state-dependent Gaussian channel with a helper

Yunhao Sun, Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai Shitz

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


The state-dependent point-to-point Gaussian channel with a helper is first studied, in which a transmitter communicates with a receiver via a state-corrupted channel. The state is not known to the transmitter nor to the receiver, but known to a helper noncausally, which then wishes to assist the receiver to cancel the state. Differently from the previous work that characterized the capacity only in the infinite state power regime, this paper explores the general case with arbitrary state power. A lower bound on the capacity is derived based on an achievable scheme that integrates direct state subtraction and single-bin dirty paper coding. By analyzing this lower bound and further comparing it with the existing upper bounds, the capacity of the channel is characterized for a wide range of channel parameters. Such an idea of characterizing the capacity is further extended to study the two-user state-dependent multiple access channel with a helper. By comparing the derived inner and outer bounds, the channel parameters are partitioned into appropriate cases, and for each case, either segments on the capacity region boundary or the full capacity region are characterized.

Original languageEnglish (US)
Article number7579205
Pages (from-to)7123-7134
Number of pages12
JournalIEEE Transactions on Information Theory
Issue number12
StatePublished - Dec 2016


  • Capacity region
  • Gel'fand-Pinsker scheme
  • channel state
  • dirty paper coding
  • multiple access channel
  • noncausal state information

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Capacity characterization for state-dependent Gaussian channel with a helper'. Together they form a unique fingerprint.

Cite this