• Title/Summary/Keyword: Decode and Forward

Search Result 193, Processing Time 0.02 seconds

Power Allocation Framework for OFDMA-based Decode-and-Forward Cellular Relay Networks

  • Farazmand, Yalda;Alfa, Attahiru S.
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.559-567
    • /
    • 2014
  • In this paper, a framework for power allocation of downlink transmissions in orthogonal frequency division multiple access-based decode-and-forward cellular relay networks is investigated. We consider a system with a single base station communicating with multiple users assisted by multiple relays. The relays have limited power which must be divided among the users they support in order to maximize the data rate of the whole network. Advanced power allocation schemes are crucial for such networks. The optimal relay power allocation which maximizes the data rate is proposed as an upper bound, by finding the optimal power requirement for each user based on knapsack problem formulation. Then by considering the fairness, a new relay power allocation scheme, called weighted-based scheme, is proposed. Finally, an efficient power reallocation scheme is proposed to efficiently utilize the power and improve the data rate of the network. Simulation results demonstrate that the proposed power allocation schemes can significantly improve the data rate of the network compared to the traditional scheme.

Spectrally-Efficient Decode-and-Forward Scheme Based on Constellation Rotation

  • Sun, Li;Zhang, Taiyi;Lu, Long;Niu, Hao
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.607-609
    • /
    • 2010
  • A spectrally-efficient scheme is proposed for orthogonal decode-and-forward relaying. By utilizing constellation rotation, the scheme can achieve twice the spectral efficiency as that of the conventional one, with low implementation complexity. It can offer a full diversity order as well, whereas the loss in coding gain is less than 1 dB for practical environments.

Decode-and-Forward Relaying Systems with Nth Best-Relay Selection over Rayleigh Fading Channels

  • Duy, Tran Trung;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.12 no.1
    • /
    • pp.8-12
    • /
    • 2012
  • In this paper, we evaluate performances of dual-hop decode-and-forward relaying systems with the $N^{th}$ best-relay selection scheme. In some schemes, such as scheduling or load balancing schemes, the best relay is unavailable and hence the system must resort the second best, third best, or generally the $N^{th}$ best relay. We derive the expressions of the outage probability and symbol error rate (SER) for this scenario over Rayleigh fading channels. Monte-Carlo simulations are presented to verify the analytical results.

Performance Analysis of Multi-Hop Decode-and-Forward Relaying with Selection Combining

  • Bao, Vo Nguyen Quoe;Kong, Hyung-Yun
    • Journal of Communications and Networks
    • /
    • v.12 no.6
    • /
    • pp.616-623
    • /
    • 2010
  • In this paper, exact closed-form expressions for outage probability and bit error probability (BEP) are presented for multi-hop decode-and-forward (DF) relaying schemes in conjunction with cooperative diversity, in which selection combining technique is employed at each node. We have shown that the proposed protocol offers remarkable diversity advantage over direct transmission as well as the conventional DF relaying schemes with the same combining technique. We then investigate the system performance when different diversity schemes are employed. It has been observed that the system performance loss due to selection combining relative to maximal ratio combining is not significant. Simulations are performed to confirm our theoretical analysis.

Naïve Decode-and-Forward Relay Achieves Optimal DMT for Cooperative Underwater Communication

  • Shin, Won-Yong;Yi, Hyoseok
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.4
    • /
    • pp.229-234
    • /
    • 2013
  • Diversity-multiplexing tradeoff (DMT) characterizes the fundamental relationship between the diversity gain in terms of outage probability and the multiplexing gain as the normalized rate parameter r, where the limiting transmission rate is give by rlog SNR (here, SNR denote the received signal-to-noise ratio). In this paper, we analyze the DMT and performance of an underwater network with a cooperative relay. Since over an acoustic channel, the propagation delay is commonly considerably higher than the processing delay, the existing transmission protocols need to be explained accordingly. For this underwater network, we briefly describe two well-known relay transmissions: decode-and-forward (DF) and amplify-and-forward (AF). As our main result, we then show that an instantaneous DF relay scheme achieves the same DMT curve as that of multiple-input single-output channels and thus guarantees the DMT optimality, while using an instantaneous AF relay leads at most only to the DMT for the direct transmission with no cooperation. To validate our analysis, computer simulations are performed in terms of outage probability.

The Performance of Multistage Cooperation in Relay Networks

  • Vardhe, Kanchan;Reynolds, Daryl
    • Journal of Communications and Networks
    • /
    • v.17 no.5
    • /
    • pp.499-505
    • /
    • 2015
  • We analyze the performance of multistage cooperation in decode-and-forward relay networks where the transmission between source and destination takes place in $T{\geq}2$ equal duration and orthogonal time phases with the help of relays. The source transmits only in the first time phase. All relays that can decode the source's transmission forward the source's message to the destination in the second time phase, using a space-time code. During subsequent time phases, the relays that have successfully decoded the source message using information from all previous transmitting relays, transmit the space-time coded symbols for the source's message. The non-decoding relays keep accumulating information and transmit in the later stages when they are able to decode. This process continues for T cooperation phases. We develop and analyze the outage probability of multistage cooperation protocol under orthogonal relaying. Through analytical results, we obtain the near-optimal placement strategy for relays that gives the best performance when compared with most other candidate relay location strategies of interest. For different relay network topologies, we also investigate an interesting tradeoff between an increased SNR and decreased spectral efficiency as the number of cooperation stages is increased. It is also shown that the largest multistage cooperation gain is obtained in the low and moderate SNR regime.

Spectrum Sharing-Based Multi-Hop Decode-and-Forward Relay Networks under Interference Constraints: Performance Analysis and Relay Position Optimization

  • Bao, Vo Nguyen Quoc;Thanh, Tran Thien;Nguyen, Tuan Duc;Vu, Thanh Dinh
    • Journal of Communications and Networks
    • /
    • v.15 no.3
    • /
    • pp.266-275
    • /
    • 2013
  • The exact closed-form expressions for outage probability and bit error rate of spectrum sharing-based multi-hop decode-and-forward (DF) relay networks in non-identical Rayleigh fading channels are derived. We also provide the approximate closed-form expression for the system ergodic capacity. Utilizing these tractable analytical formulas, we can study the impact of key network parameters on the performance of cognitive multi-hop relay networks under interference constraints. Using a linear network model, we derive an optimum relay position scheme by numerically solving an optimization problem of balancing average signal-to-noise ratio (SNR) of each hop. The numerical results show that the optimal scheme leads to SNR performance gains of more than 1 dB. All the analytical expressions are verified by Monte-Carlo simulations confirming the advantage of multihop DF relaying networks in cognitive environments.

Cooperative Hybrid-ARQ Protocols: Unified Frameworks for Protocol Analysis

  • Byun, Il-Mu;Kim, Kwang-Soon
    • ETRI Journal
    • /
    • v.33 no.5
    • /
    • pp.759-769
    • /
    • 2011
  • Cooperative hybrid-automatic repeat request (HARQ) protocols, which can exploit the spatial and temporal diversities, have been widely studied. The efficiency of cooperative HARQ protocols is higher than that of cooperative protocols because retransmissions are only performed when necessary. We classify cooperative HARQ protocols as three decode-and-forward-based HARQ (DF-HARQ) protocols and two amplified-and-forward-based HARQ (AF-HARQ) protocols. To compare these protocols and obtain the optimum parameters, two unified frameworks are developed for protocol analysis. Using the frameworks, we can evaluate and compare the maximum throughput and outage probabilities according to the SNR, the relay location, and the delay constraint. From the analysis we can see that the maximum achievable throughput of the DF-HARQ protocols can be much greater than that of the AF-HARQ protocols due to the incremental redundancy transmission at the relay.

Exact Outage Probability of Two-Way Decode-and-Forward NOMA Scheme with Opportunistic Relay Selection

  • Huynh, Tan-Phuoc;Son, Pham Ngoc;Voznak, Miroslav
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.5862-5887
    • /
    • 2019
  • In this paper, we propose a two-way relaying scheme using non-orthogonal multiple access (NOMA) technology. In this scheme, two sources transmit packets with each other under the assistance of the decode-and-forward (DF) relays, called as a TWDFNOMA protocol. The cooperative relays exploit successive interference cancellation (SIC) technique to decode sequentially the data packets from received summation signals, and then use the digital network coding (DNC) technique to encrypt received data from two sources. A max-min criterion of end-to-end signal-to-interference-plus-noise ratios (SINRs) is used to select a best relay in the proposed TWDFNOMA protocol. Outage probabilities are analyzed to achieve exact closed-form expressions and then, the system performance of the proposed TWDFNOMA protocol is evaluated by these probabilities. Simulation and analysis results discover that the system performance of the proposed TWDFNOMA protocol is improved when compared with a conventional three-timeslot two-way relaying scheme using DNC (denoted as a TWDNC protocol), a four-timeslot two-way relaying scheme without using DNC (denoted as a TWNDNC protocol) and a two-timeslot two-way relaying scheme with amplify-and-forward operations (denoted as a TWANC protocol). Particularly, the proposed TWDFNOMA protocol achieves best performances at two optimal locations of the best relay whereas the midpoint one is the optimal location of the TWDNC and TWNDNC protocols. Finally, the probability analyses are justified by executing Monte Carlo simulations.