Coding and Decoding for the Dynamic Decode and Forward Relay Protocol

Kumar, K.R.; Caire, Giuseppe

doi:10.1109/tit.2009.2021320

Cited by 41 publications

(55 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The analysis is an extension of the single user, single relay analysis in [14], but is more involved since there are additional dependent error events for which the simple analytical techniques in [14] do not work. The details are given in Section III-B.…”

Section: B Summary Of Resultsmentioning

confidence: 99%

“…As in [14], two issues are discussed in our model: 1) the effect of decoding errors at the relay, 2) the relay decision time is a priori unknown at destination. In order to tackle 1) a decision rejection criterion is introduced at the relay such that the relay triggers transmission only when its decoding is reliable.…”

Section: B Summary Of Resultsmentioning

confidence: 99%

“…Therefore, the reliability of the relayed signal must be taken care of. The DMT analysis with finite M and T was given in [14] for the single-user relay channel. In the MARC model, there are two users interfering with each other, incurring different types of error events for which the single-user analysis is not applicable.…”

Section: A Effect Of Finite Block Lengthmentioning

confidence: 99%

See 2 more Smart Citations

Dynamic decode and forward for the multi-access relay channel with finite block length

Lee

2011

2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

The dynamic decode-and-forward (DDF) protocol for the multiple access relay channel (MARC) with quasi static fading is evaluated using the Zheng-Tse diversity-multiplexing tradeoff (DMT). We assume that there are two users, one half-duplex relay, and a common destination, each equipped with single antenna. For the Rayleigh fading channel, the DDF protocol is well known and has been analyzed in terms of the DMT with the infinite block length assumption by Azarian et al. However, to make the protocol feasible, the practical constraint of finite block length must be enforced, which may result in a loss in the DMT. Another practical effect not considered in the infinite block length DDF protocol is the possible decoding error at the relay. By carefully dealing with these practical issues due to finite block length, we characterize the finite block length DMT of the DDF protocol. We further consider the situation where the destination does not have a priori knowledge of the relay decision time at which the relay switches from listening to transmitting, and show that the optimal DMT is still achievable as if there is no decoding error at the relay. Therefore, the assumption of error-free decoding at the relay and additional protocol overhead to communicate the decision time are not needed for the DDF to achieve the optimal DMT.

show abstract

Section: B Summary Of Resultsmentioning

confidence: 99%

Section: B Summary Of Resultsmentioning

confidence: 99%

Section: A Effect Of Finite Block Lengthmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic decode and forward for the multi-access relay channel with finite block length

Lee

2011

2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

show abstract

“…OSTBCs are cascaded at each relay stage by first separating each constellation symbol of the OSTBC transmitted from the preceding relay stage, and then transmitting another OSTBC to the next relay stage. The proposed OSTBC cascading strategy is novel, and different than other approaches that use Alamouti code or OSTBC in a distributed manner [12,31].…”

Section: Remark 3 Csimentioning

confidence: 99%

Cascaded orthogonal space–time block codes for wireless multi-hop relay networks

Vaze

Heath

2013

J Wireless Com Network

View full text Add to dashboard Cite

Distributed space-time block coding is a diversity technique to mitigate the effects of fading in multi-hop wireless networks, where multiple relay stages are used by a source to communicate with its destination. This article proposes a new distributed space-time block code called the cascaded orthogonal space-time block code (COSTBC) for the case where the source and destination are equipped with multiple antennas and each relay stage has one or more multiple antenna relays. Each relay stage is assumed to have receive channel state information (CSI) for all the channels from the source and all relays from previous stages to itself, while the destination is assumed to have receive CSI for all the channels. To construct the COSTBC, multiple orthogonal space-time block codes (OSTBCs) are used in cascade by the source and each relay stages. In the COSTBC, each relay stage separates the constellation symbols of the OSTBC sent by the preceding relay stage using its CSI, and then transmits another OSTBC to the next relay stage. COSTBCs are shown to achieve the maximum diversity gain in a multi-hop wireless network with linear decoding complexity thanks to the connection to OSTBCs. Several explicit constructions of COSTBCs are also provided, and their performance is simulated in different relay configurations.

show abstract

“…The DDF protocol was first proposed and analyzed in terms of diversity-multiplexing tradeoff (DMT) in [2]. Code design for the DDF protocol was discussed from theoretical perspectives in, for example, [3]- [5]. In a recent contribution [6], Raptor codes were taken into account as a practical coding implementation for DDF relaying, and they are able This work was supported in part by the European Community's Seventh Framework Programme under grant agreement no 257626 (ACROPOLIS) and the Swedish Foundation for Strategic Research. to closely approach the achievable rate of the relay channel.…”

Section: Introductionmentioning

confidence: 99%

Dynamic decode-and-forward relaying with rate-compatible LDPC convolutional codes

Thobaben

Skoglund

2012

2012 5th International Symposium on Communications, Control and Signal Processing

View full text Add to dashboard Cite

Dynamic decode-and-forward (DDF) is an improved decode-and-forward (DF) protocol under which the relay decides based on its received channel-state information (CSI) when to switch from listening mode to transmission mode without knowing the CSI of other links. In this paper we propose to apply rate-compatible LDPC convolutional (RC-LDPCC) codes to the DDF relay channel. The RC-LDPCC codes are constructed by successive graph extensions, and they have been proved analytically to be capacity achieving over the binary erasure channel. In this paper we show that the RC-LDPCC codes fit well with the DDF relaying, and the regularity of degree distributions simplifies the code optimization. Numerical results in terms of bit erasure rate and achievable rate are provided to evaluate the performance of the system. The results show that the RC-LDPCC codes are able to provide high achievable rates for the DDF relay channel.

show abstract

Coding and Decoding for the Dynamic Decode and Forward Relay Protocol

Cited by 41 publications

References 29 publications

Dynamic decode and forward for the multi-access relay channel with finite block length

Dynamic decode and forward for the multi-access relay channel with finite block length

Cascaded orthogonal space–time block codes for wireless multi-hop relay networks

Dynamic decode-and-forward relaying with rate-compatible LDPC convolutional codes

Contact Info

Product

Resources

About