Achievable Rates for Gaussian Degraded Relay Channels With Non-Vanishing Error Probabilities

DOI10.1109/TIT.2017.2690994MaRDI QIDQ5358563zbMATH OpenOpenAlexFDO

Authors Silas L. Fong, Vincent Y. F. Tan

Publication date 21 September 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1604.01566

Mathematics Subject Classification ID

Information theory (general) (94A15)

Abstract: This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The source and the relay are subject to expected power constraints. The $varepsilon$-capacity of the channel is characterized and it is strictly larger than the capacity for $varepsilon>0$, which implies that the channel does not possess the strong converse property. The proof of the achievability part is based on several key ideas: block Markov coding which is used in the classical decode-forward strategy, power control for Gaussian channels under expected power constraints, and a careful scaling between the block size and the total number of block uses. The converse part is proved by first establishing two non-asymptotic lower bounds on the error probability, which are derived from the type-II errors of some binary hypothesis tests. Subsequently, each lower bound is simplified by conditioning on an event related to the power of some linear combination of the codewords transmitted by the source and the relay. Lower and upper bounds on the second-order term of the optimal coding rate in terms of blocklength and error probability are also obtained.

Cited in

(8)

• Strong converse theorems for multimessage networks with tight cut-set bound
• Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay Network
• Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations
• Gallager Bounds for Noncoherent Decoders in Fading Channels
• Ergodic Channel Capacity of an Amplify-and-Forward Relay System at Low SNR in a Generic Noise Environment
• scientific article; zbMATH DE number 7028450 (Why is no real title available?)
• Achievable Rates for Nonlinear Volterra Channels
• On Achievable Rates for the General Relay Channel

This page was built for publication: Achievable Rates for Gaussian Degraded Relay Channels With Non-Vanishing Error Probabilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358563)