Capacity Bounds for Relay Channels With Intersymbol Interference and Colored Gaussian Noise
From MaRDI portal
Publication:2986173
DOI10.1109/TIT.2014.2322859zbMATH Open1360.94235arXiv1103.0089OpenAlexW2964124566MaRDI QIDQ2986173FDOQ2986173
Authors: Chiranjib Choudhuri, Urbashi Mitra 
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1103.0089
Cited In (2)
This page was built for publication: Capacity Bounds for Relay Channels With Intersymbol Interference and Colored Gaussian Noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986173)
