The density of radio access points in currently deployed cellular networks increases in order to improve the reuse of available resources and to serve more user terminals at high data rates. This implies higher deployment costs, which demands low-cost and flexible alternatives. However, this ambitious goal cannot be accomplished with conventional cellular systems but requires new technologies s...

In this paper, the impact of limited resources on achievable rates in relay channels is investigated. Resource limitation is modeled as a rate constraint, R, which constrains the rate at which a relay can reliably decode or source-code data. With this constraint in hand, the achievable rates for several protocols are derived and compared: decode-and-forward, estimate-and-forward, a Markovian am...

A new coding scheme for general N -node relay networks is presented for unicast, multicast, and broadcast. The proposed distributed decode–forward scheme combines and generalizes Marton coding for single-hop broadcast channels and the Cover–El Gamal partial decode–forward coding scheme for 3-node relay channels. The key idea of the scheme is to precode all the codewords of the entire network at...

We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to the relay and to the destination; and the relay facilitates this communication by sending an additional message to the destination through a...

This paper considers the partial decode-and-forward (PDF) strategy for the Gaussian multiple-input multiple-output (MIMO) relay channel. Unlike for the decode-and-forward (DF) strategy or pointto-point (P2P) transmission, for which Gaussian channel inputs are known to be optimal, the input distribution that maximizes the achievable PDF rate for the Gaussian MIMO relay channel has remained unkno...