Capacity Bounds for Relay Channels with Inter-symbol Interference and Colored Gaussian Noise

TL;DR

This paper derives capacity bounds and achievable rates for relay channels affected by inter-symbol interference and colored Gaussian noise, extending existing models and providing new single-letter expressions and power allocation strategies.

Contribution

It introduces single-letter expressions for achievable rates with decode-and-forward and compress-and-forward at the relay, and generalizes the cut-set bound for ISI and colored noise.

Findings

Derived single-letter achievable rate expressions for DF and CF.

Generalized the cut-set bound for channels with ISI and colored noise.

Provided numerical examples illustrating the bounds and strategies.

Abstract

The capacity of a relay channel with inter-symbol interference (ISI) and additive colored Gaussian noise is examined under an input power constraint. Prior results are used to show that the capacity of this channel can be computed by examining the circular degraded relay channel in the limit of infinite block length. The current work provides single letter expressions for the achievable rates with decodeand- forward (DF) and compress-and-forward (CF) processing employed at the relay. Additionally, the cut-set bound for the relay channel is generalized for the ISI/colored Gaussian noise scenario. All results hinge on showing the optimality of the decomposition of the relay channel with ISI/colored Gaussian noise into an equivalent collection of coupled parallel, scalar, memoryless relay channels. The region of optimality of the DF and CF achievable rates are also discussed. Optimal power allocation strategies are also discussed for the two lower bounds and the cut-set upper bound. As the maximizing power allocations for DF and CF appear to be intractable, the desired cost functions are modified and then optimized. The resulting rates are illustrated through the computation of numerical examples.