Premium
Capacity region of the Gaussian doubly dirty two‐way channel in the presence of partial side information
Author(s) -
Monemizadeh Narges,
Hodtani Ghosheh Abed
Publication year - 2016
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.2910
Subject(s) - dirty paper coding , gaussian , lattice (music) , channel capacity , computer science , coding (social sciences) , channel (broadcasting) , upper and lower bounds , decoding methods , adaptive capacity , gaussian noise , mathematics , topology (electrical circuits) , telecommunications , algorithm , combinatorics , physics , statistics , mathematical analysis , acoustics , biology , quantum mechanics , precoding , ecology , mimo , climate change
In this paper, we characterize capacity region of the Gaussian doubly dirty two‐way channel (TWC) with partial side information at users, where there are two additive interference signals that, although similar to the channel noise sequences, corrupt the transmitted signals but are non‐causally and partially known to the users. First, by employing adaptation (considering the previously received signals in encoding process), we derive an adaptive outer bound on the capacity region of the channel. Then, we utilize lattice strategies and obtain a non‐adaptive inner bound that coincides with the adaptive outer bound and hence gives the capacity region. This also shows that for the doubly dirty TWC with partial side information, adaptation is useless and cannot increase the capacity region. Finally, we prove that Costa's dirty paper coding is optimal like lattice strategies and therefore, the Gaussian doubly dirty TWC is an instance of multi‐user channels in which lattice strategy and Costa's strategy have the same performance from the capacity region perspective. It is worth noting that our results subsume the previous related works as special cases. Copyright © 2014 John Wiley & Sons, Ltd.