Computer Science – Information Theory
Scientific paper
2010-01-26
IEEE Transactions on Information Theory, vol. 57, no. 5, pp. 2966-2975, May 2011
Computer Science
Information Theory
17 pages, 7 figures; added new subfigure in Figure 4, included discussion about numerical evaluation method, introduction clar
Scientific paper
10.1109/TIT.2011.2119890
An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver. It is shown that this interference-decoding inner bound is tight under certain strong interference conditions. The inner bound is also shown to strictly contain the inner bound obtained by treating interference as noise, which includes interference alignment for deterministic channels. The gain comes from judicious analysis of the number of combined interference sequences in different regimes of input distributions and message rates. Finally, the inner bound is generalized to the case where each channel output is observed through a noisy channel.
Bandemer Bernd
El Gamal Abbas
No associations
LandOfFree
Interference Decoding for Deterministic Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Interference Decoding for Deterministic Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interference Decoding for Deterministic Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-643937