Ron Dabora

Broadcast Channels With Cooperating Decoders

We consider the problem of communicating over the general discrete memoryless broadcast channel (DMBC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite capacities, prior to decoding the messages sent from the transmitter. In this paper, we formulate the general problem of broadcast with cooperation. We first find the capacity region for the case where the BC is physically degraded. Then, we give achievability results for the general broadcast channel, for both the two independent messages case and the single common message case

On the capacity of the interference channel with a relay

Capacity gains due to relaying in wireless networks with multiple source-destination pairs are analyzed. A two- source, two-receiver network with the relay is considered. The focus is on the scenario in which, due to channel conditions, the relay can observe the signal from only one source. The relay can thus help the intended receiver of this message, via message forwarding, to decode it. In addition, the relay can simultaneously help the unintended receiver subtract the interference associated with this message. We call the latter strategy interference forwarding. An achievable rate region employing decode-and-forward (that simultaneously does message and interference forwarding) at the relay is derived and analyzed. This strategy is shown to achieve the capacity region under certain conditions. Our results demonstrate that the relay can help both receivers, despite the fact that it forwards only the message intended for one of them. This applies in general to communications in the presence of an interferer transmitting at any arbitrary rate. Interference forwarding improves reception of interfering signals at the receivers. This facilitates decoding of the unwanted messages and eliminating the resulting interference. Therefore, in networks with multiple source-destination pairs, in addition to relaying messages, interference forwarding may also be employed to help in combating interference.

On the Role of Estimate-and-Forward With Time Sharing in Cooperative Communication

In this paper, we focus on the general relay channel. We investigate the application of the estimate-and-forward (EAF) relaying scheme to different scenarios. Specifically, we study assignments of the auxiliary random variable that always satisfy the feasibility constraints. We then consider the Gaussian relay channel with coded modulation, where we show that a three-level quantization outperforms the Gaussian quantization commonly used to evaluate the achievable EAF rates in this scenario. Last, we consider the cooperative general broadcast scenario with a multistep conference between the receivers. We first apply EAF to obtain a general achievable rate region with a multistep conference. We then use an explicit assignment for the auxiliary random variables to obtain an explicit rate expression for the single common message case with a two-step conference.

Relaying in the Presence of Interference: Achievable Rates, Interference Forwarding, and Outer Bounds

The smallest network model that captures relaying in the presence of multiple communicating pairs causing interference to each other is the interference channel with a relay. In this paper, an achievable rate region for the interference channel with a relay is derived. Special cases of strong interference under which this region is the capacity region are presented. The results obtained demonstrate the benefits of interference forwarding at a relay. By forwarding interfering messages, the relay can improve their reception at unintended receivers and, thus, facilitate interference cancellation. We show that intentionally forwarding interfering messages can improve the achievable rates. The achievable rates and interference forwarding gains are also illustrated by numerical results in Gaussian channels. Finally, a sum-rate outer bound to the capacity region of the Gaussian interference channel with a relay is derived and compared with the achievable rate region. The cut-set bound for this channel is also derived and shown to be much looser than the new sum-rate outer bound.

On the Capacity of Narrowband PLC Channels

Power line communications (PLC) is the central communications technology for the realization of smart power grids. As the designated band for smart grid communications is the narrowband (NB) power line channel, NB-PLC has been receiving substantial attention in recent years. Narrowband power line channels are characterized by cyclic short-term variations of the channel transfer function (CTF) and strong noise with periodic statistics. In this paper, modeling the CTF as a linear periodically time-varying filter and the noise as an additive cyclostationary Gaussian process, we derive the capacity of discrete-time NB-PLC channels. As part of the capacity derivation, we characterize the capacity achieving transmission scheme, which leads to a practical code construction that approaches capacity. The capacity derived in this work is numerically evaluated for several NB-PLC channel configurations taken from previous works, and the results show that the optimal scheme achieves a substantial rate gain over a previously proposed ad-hoc scheme. This gain is due to optimally accounting for the periodic properties of the channel and the noise.

Source-Channel Coding Theorems for the Multiple-Access Relay Channel

We study reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs). In MARCs only the destination is interested in reconstructing the sources, while in MABRCs, both the relay and the destination want to reconstruct them. In addition to arbitrary correlation among the source signals at the users, both the relay and the destination have side information correlated with the source signals. Our objective is to determine whether a given pair of sources can be losslessly transmitted to the destination for a given number of channel symbols per source sample, defined as the source-channel rate. Sufficient conditions for reliable communication based on operational separation, as well as necessary conditions on the achievable source-channel rates are characterized. Since operational separation is generally not optimal for MARCs and MABRCs, sufficient conditions for reliable communication using joint source-channel coding schemes based on a combination of the correlation preserving mapping technique with Slepian-Wolf source coding are also derived. For correlated sources transmitted over fading Gaussian MARCs and MABRCs, we present conditions under which separation (i.e., separate and stand-alone source and channel codes) is optimal. This is the first time optimality of separation is proved for MARCs and MABRCs.

An outer bound for the Gaussian interference channel with a relay

A novel sum-rate outer bound for the Gaussian interference channel with a relay is presented. The outer bound is obtained by adapting the genie-aided approach developed for interference channels in. The cut-set bound for this channel is also derived and is shown to be much looser than the new bound. The new bound is also compared to an achievable rate region we introduced in previous work. We show that the inner and outer bounds are close in the regime of strong interference where receivers can decode both messages. The capacity region in strong interference for the discrete memoryless degraded channel is also presented.

Generalized relaying in the presence of interference

Capacity gains from cooperation in a network with two source-destination pairs and a relay are analyzed. Scenarios in which the relay decodes both messages are considered. An achievable rate region is derived and evaluated for Gaussian channels. A simple encoding scheme is employed that does not include rate-splitting at the encoders and/or the relay. The obtained results demonstrate the gains from interference forwarding in certain scenarios: the relay optimally splits its power between sending the desired message and the interference. Thus, instead of only message forwarding, the relay uses some of its power to facilitate interference cancelation at the destination node.

The Capacity Region of the Fading Interference Channel With a Relay in the Strong Interference Regime

The interference channel with a relay (ICR) is the fundamental building block of cooperation in wireless networks where there are multiple communicating pairs interfering with each other. This paper considers ICRs in which the links are subject to i.i.d. fading, and each node has channel state information (CSI) only on its incoming links (receive CSI). Two channel models are considered: phase fading and Rayleigh fading. Strong interference conditions are derived for the case where the links from the sources to the relay are good in the sense that the achievable region for decoding both messages at the relay contains the maximal achievable region at the destinations. This leads to the characterization of the capacity region for such scenarios. This is the first time the capacity region of the ICR is characterized for a nondegraded, noncognitive scenario, with a causal relay when all links are active.

Broadcast channels with cooperating receivers: a downlink for the sensor reachback problem

This paper describes the problem of communicating over broadcast channels (BCs) with partially cooperating receivers. In our setup receivers are able to exchange messages over conference links, prior to making their decisions. This problem comes up naturally in a sensor networking application, where a transmitter external to the sensor network wants to download data into the network to, e.g., configure the sensor array. We find the capacity region for the case where the BC is degraded. This region is a strict enlargement of the classical region for the degraded BC without cooperation in [T.M. Cover,(1998)].