A New Achievable Rate for the Gaussian Parallel Relay Channel

Simple item page
dc.creatorSaeed, Seyed
dc.creatorRezaei, Changiz
dc.creatorGharan, Shahab Oveis
dc.creatorKhandani, Amir K.
dc.date2009-02-10
dc.date.accessioned2026-07-07T12:39:56Z
dc.date.available2026-07-07T12:39:56Z
dc.descriptionSchein and Gallager introduced the Gaussian parallel relay channel in 2000. They proposed the Amplify-and-Forward (AF) and the Decode-and-Forward (DF) strategies for this channel. For a long time, the best known achievable rate for this channel was based on the AF and DF with time sharing (AF-DF). Recently, a Rematch-and-Forward (RF) scheme for the scenario in which different amounts of bandwidth can be assigned to the first and second hops were proposed. In this paper, we propose a \emph{Combined Amplify-and-Decode Forward (CADF)} scheme for the Gaussian parallel relay channel. We prove that the CADF scheme always gives a better achievable rate compared to the RF scheme, when there is a bandwidth mismatch between the first hop and the second hop. Furthermore, for the equal bandwidth case (Schein's setup), we show that the time sharing between the CADF and the DF schemes (CADF-DF) leads to a better achievable rate compared to the time sharing between the RF and the DF schemes (RF-DF) as well as the AF-DF.
dc.description22 pages, 9 figures, Submitted to Transaction on Information Theory
dc.identifierhttps://arxiv.org/abs/0902.1734
dc.identifierhttp://arxiv.org/abs/0902.1734
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219297
dc.subjectInformation Theory
dc.titleA New Achievable Rate for the Gaussian Parallel Relay Channel
dc.typetext

Files

Collections

arXiv