Generalized Backward Decoding Strategies for the Relay Channel

Chong, Hon-Fah; Motani, Mehul; Garg, H.K.

doi:10.1109/tit.2006.887067

Cited by 47 publications

(36 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In block b + 2, both relays cooperatively send r(b + 2) = (r 1 (b + 1), r 2 (b + 1)) (common part) to both receivers. The decoding strategy at the receivers is simultaneous backward as in [18] and [17] (see Table I). For (3)) q(r(4)) (r(1) = (1, 1) = 1) (r(2) = (1, 1) = 1) (r(3) = (r 1 (2), r 2 (2))) (r(4) = (r 1 (3), r 2 (3))) (3)) u 23 (1|r (4)) (3)) u 32 (1|r(4)) .…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

An achievable rate region for Broadcast-Relay Networks with partial cooperation between relays

Salehkalaibar

Ghabeli

Aref

2010

2010 Australian Communications Theory Workshop (AusCTW)

View full text Add to dashboard Cite

1 Abstract-In this paper, we consider a different strategy for Broadcast-Relay-Networks (BRN) with two relays. There are a transmitter, two relays and two receivers in this network. The message of the transmitter intended to the receivers, has both common and private parts. The relays partially cooperate with each other and with the transmitter to send the common part of the message. The private parts of the message are sent to the corresponding receiver by the cooperation of the corresponding relay. We propose an achievable rate region for this network. In the proof, we take advantage of regular encoding/sliding window decoding at relays and simultaneous backward decoding analysis at receivers. The partial cooperation between relays is managed by symmetric relaying strategy. We will show that two special cases of our achievable rate region are: 1) Kramer's achievable rate region for Broadcast-Relay-Channel (BRC), 2) Salehkalaibar's achievable rate region for BroadcastRelay-Network (BRN), by the assumption that the private parts are relaxed in these two models. This assumption is suitable for comparison of the BC models, because the main point in broadcasting is managing the common parts of the message. The private parts are defined according to application of the network. Obviously, the proposed achievable rate region includes Ghabeli's rate for the symmetric two-relay network.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Simultaneous backward decoding strategy had been studied in [17] for the relay channel and in [18] for the relay network. We also use symmetric relaying strategy as in [15] at the relays.…”

Section: Main Contributions and Organizationmentioning

confidence: 99%

An achievable rate region for Broadcast-Relay Networks with partial cooperation between relays

Salehkalaibar

Ghabeli

Aref

2010

2010 Australian Communications Theory Workshop (AusCTW)

View full text Add to dashboard Cite

show abstract

“…However, the decoding strategy of GHF differs from that of EHF in that list decoding is performed on U rather than X. The rate expression in Theorem 1 can also be derived using a joint decoding strategy on (U, X) as shown in [8], [9]. All of these strategies share the common feature that unlike CF, U is not decoded exactly first.…”

Section: Theorem 1 (Achievable Rate Of Ghf)mentioning

confidence: 99%

Universal relaying for the interference channel

Razaghi

2010

2010 Information Theory and Applications Workshop (ITA)

View full text Add to dashboard Cite

Abstract-This paper considers a Gaussian relay-interference channel and introduces a generalized hash-and-forward relay strategy, where the relay sends out a bin index of its quantized observation, and the receivers first decode the relay quantization codeword to a list, then use the list to help decode the respective messages from the transmitters. The main advantage of the proposed approach is in a scenario where the relay observes a linear combination of the transmitted signals and broadcasts a common relay message through a digital relay link of fixed rate to help both receivers of the interference channel. We show that when compared to the achievable rates with interference treated as noise, generalized hash-and-forward can provide one bit of rate improvement for every relay bit for both users at the same time in an asymptotic regime where the background noises go down to zero. The proposed approach is universal, in contrast to the compress-and-forward or amplify-and-forward strategies which are not asymptotically optimal for multiple users simultaneously, if at all.

show abstract

“…However, in that work, the SNR regions at which the generalized DF-CF reduces to either the DF or the CF scheme were not identified, nor those at which the generalization is guaranteed to yield strictly higher rates. In fact, the analysis of the generalized DF-CF in [26] did prove the existence of distinct SNR operation regions and did not bound the maximum rate advantage.…”

Section: Introductionmentioning

confidence: 98%

“…Hence, the analysis methodology proposed herein for the generalized DF-CF scheme in [5,Theorem 7] can be extended to those mixed strategies. Numerical examples that demonstrate the potential advantage of the generalized DF-CF [5,Theorem 7] with Gaussian signals over individual DF and CF schemes were provided in [26]. However, in that work, the SNR regions at which the generalized DF-CF reduces to either the DF or the CF scheme were not identified, nor those at which the generalization is guaranteed to yield strictly higher rates.…”

Section: Introductionmentioning

confidence: 99%

Analysis of the Generalized DF-CF for Gaussian Relay Channels: Decode or Compress?

Luo

Gohary

Yanıkömeroğlu

2013

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-We consider a three-node quasi-static communication system with a full-duplex relay. The goal is to determine the relaying mode that enables rate-efficient communication under given channel conditions. To achieve this goal, we consider a generalized scheme that subsumes the decode-and-forward (DF) and compress-and-forward (CF) schemes as special cases. The generalized scheme is considered when the source and relay signals are synthesized from commonly-used Gaussian codebooks, which are shown to be capacity achieving in two asymptotic cases: perfect relay-destination link and broken source-destination link. Studying the generalized DF-CF scheme, it is shown that, for two non-asymptotic cases in which the signal-to-noise ratios (SNRs) of the links satisfy certain conditions, this scheme reduces to either DF or CF. For another set of non-asymptotic SNRs, the generalized scheme is shown to yield strictly higher rates than both DF and CF. Despite the complexity of the generalized scheme, its rate advantage over DF and CF is shown to be upper bounded by 0.5 bits per channel use. This indicates that the practical benefit of the analysis of this scheme is to enable selecting the relaying mode that suits a given channel realization. Numerical results show that, under Rayleigh fading conditions, this selection yields significant gains over fixed DF and CF.

show abstract

Generalized Backward Decoding Strategies for the Relay Channel

Cited by 47 publications

References 9 publications

An achievable rate region for Broadcast-Relay Networks with partial cooperation between relays

An achievable rate region for Broadcast-Relay Networks with partial cooperation between relays

Universal relaying for the interference channel

Analysis of the Generalized DF-CF for Gaussian Relay Channels: Decode or Compress?

Contact Info

Product

Resources

About