Parallel Gaussian Channels Corrupted by Independent States With a State-Cognitive Helper

Dikshtein, Michael; Duan, Ruchen; Liang, Y. T.; Shamai, Shlomo

doi:10.1109/icsee.2018.8646036

Cited by 2 publications

(1 citation statement)

References 11 publications

(11 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We will apply this bound for the MIMO Gaussian setting and characterize the segments of the capacity region for various channel parameters. The material in this paper was presented in part at [35,36].…”

Section: P Smentioning

confidence: 99%

MIMO Gaussian State-Dependent Channels with a State-Cognitive Helper

Dikshtein

Duan

Liang

et al. 2019

Entropy

Self Cite

View full text Add to dashboard Cite

We consider the problem of channel coding over multiterminal state-dependent channels in which neither transmitters nor receivers but only a helper node has a non-causal knowledge of the state. Such channel models arise in many emerging communication schemes. We start by investigating the parallel state-dependent channel with the same but differently scaled state corrupting the receivers. A cognitive helper knows the state in a non-causal manner and wishes to mitigate the interference that impacts the transmission between two transmit–receive pairs. Outer and inner bounds are derived. In our analysis, the channel parameters are partitioned into various cases, and segments on the capacity region boundary are characterized for each case. Furthermore, we show that for a particular set of channel parameters, the capacity region is entirely characterized. In the second part of this work, we address a similar scenario, but now each channel is corrupted by an independent state. We derive an inner bound using a coding scheme that integrates single-bin Gel’fand–Pinsker coding and Marton’s coding for the broadcast channel. We also derive an outer bound and further partition the channel parameters into several cases for which parts of the capacity region boundary are characterized.

show abstract

Section: P Smentioning

confidence: 99%

MIMO Gaussian State-Dependent Channels with a State-Cognitive Helper

Dikshtein

Duan

Liang

et al. 2019

Entropy

Self Cite

View full text Add to dashboard Cite

show abstract

Parallel Gaussian Channels Corrupted by Independent States With a State-Cognitive Helper

Dikshtein

Duan

Liang

et al. 2018

2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE)

View full text Add to dashboard Cite

We consider a state-dependent parallel Gaussian channel with independent states and a common cognitive helper, in which two transmitters wish to send independent information to their corresponding receivers over two parallel subchannels. Each channel is corrupted by independent additive Gaussian state. The states are not known to the transmitters nor to the receivers, but known to a helper in a noncausal manner. The helper's goal is to assist a reliable communication by mitigating the state. Outer and inner bounds are derived and segments of the capacity region is characterized for various channel parameters. Index TermsDirty paper coding, Gel'fand-Pinsker scheme, noncausal channel state information, parallel channel.

show abstract

Parallel Gaussian Channels Corrupted by Independent States With a State-Cognitive Helper

Cited by 2 publications

References 11 publications

MIMO Gaussian State-Dependent Channels with a State-Cognitive Helper

MIMO Gaussian State-Dependent Channels with a State-Cognitive Helper

Parallel Gaussian Channels Corrupted by Independent States With a State-Cognitive Helper

Contact Info

Product

Resources

About