MC-CDMA 시스템에 대한 주파수 효율적인 CDD-DF-Relay 기법에 관한 연구

고균병(Kyun-Byoung Ko),우중재(Choong-Chae Woo) 大韓電子工學會 2011 電子工學會論文誌-TC (Telecommunications) Vol.48 No.5

본 논문에서는 CDD-DF-Relay 기법을 MC-CDMA 시스템에 대해 제안하고 제안된 기법의 성능을 다중경로 레일리 페이딩 채널에서 검증한다. 일반적인 DF-Relay 기법에서는 모든 Relay들이 직교 채널들로 신호를 전송하여야 하기 때문에 그 장점 즉, 다이버시티 이득은 주파수 효율의 저하로부터 얻어진다고 할 수 있다. 따라서 이러한 주파수 효율 저하의 문제점을 해결하기 위하여 본 논문에서는 CDD 기법을 각 Relay 노드에 적용하여 모든 Relay가 하나의 채널만을 사용하도록 한다. 이는 Destination에서 바라본 하나의 R-D 링크 채널의 Delay Spread가 길어지는 효과를 갖는다. 즉 Relay 개수의 증가에 따라 다중 경로수가 증가됨을 의미하고, 이는 MC-CDMA 시스템에서 주파수 다이버시티 이득으로 해설될 수 있다. 모의실험에서는 일반적인 DF-Relay 기법과 제안된 CDD-DF-Relay 기법의 성능을 비교 분석한다. 이를 통해 제안된 기법이 주파수 효율의 저하없이 협력 다이버시디 이득을 획득할 수 있음을 확인하였다. In this paper, CDD(Cyclic Delay Diversity)-DF(Decode-and-Forward)-Relay scheme is proposed for MC-CDMA(Multicarrier-Code Division Multiple Access) systems over multipath Rayleigh fading channels. The advantages of general DF schemes come at the expense of the spectral efficiency since the source and all the relays must transmit on orthogonal channels. In order to mitigate this disadvantage of general DF schemes, we have applied CDD techniques to each relays so that all the relays can transmit on single channel. It means that all R-D link channels can be considered as a single channel which is widely delay spread. Namely, it causes the increasing the number of multipath so that the frequency diversity gain can be achieved in MC-CDMA systems. By simulations, we have compared proposed one with general DF scheme. Therefore, it is confirmed that the proposed one can be a possible solution to achieve cooperative diversity gain without a reduction of spectral efficiency.

Secure Communication in Multiple Relay Networks Through Decode-and-Forward Strategies

Bassily, Raef,Ulukus, Sennur The Korea Institute of Information and Commucation 2012 Journal of communications and networks Vol.14 No.4

In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decodeand-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.

Outage Capacity Analysis for Cooperative DF and AF Relaying in Dissimilar Rayleigh Fading Channels

스레스타,장경희,Shrestha, Suchitra,Chang, Kyung-Hi The Korea Institute of Information and Commucation 2008 韓國通信學會論文誌 Vol.33 No.4A

Cooperative relaying permits one or more relay to transmit a signal from the source to the destination, thereby increasing network coverage and spectral efficiency. The performance of cooperative relaying is often measured as outage probability. However, appropriate measure for the channel quality is outage capacity. Although the outage probability for cooperative relaying protocol has been analyzed before, very little research has been addressed for the outage capacity. This paper is the first of its kind to derive a closed-form analytical solution of outage capacity using fixed decode and forward relaying and amplify and forward relaying in dissimilar Rayleigh fading channels, considering channel coefficients known to the receiver side. The analytical results show a tradeoff between the SNR and the number of relays for specific outage capacity. A comparison between decode and forward relaying and amplify and forward relaying shows that decode and forward relaying outperforms amplify and forward relaying for a large number of relays.

Outage Capacity Analysis for Cooperative DF and AF Relaying in Dissimilar Rayleigh Fading Channels

Suchitra Shrestha(스레스타),KyungHi Chang(장경희) 한국통신학회 2008 韓國通信學會論文誌 Vol.33 No.4A

Cooperative relaying permits one or more relay to transmit a signal from the source to the destination, thereby increasing network coverage and spectral efficiency. The performance of cooperative relaying is often measured as outage probability. However, appropriate measure for the channel quality is outage capacity. Although the outage probability for cooperative relaying protocol has been analyzed before, very little research has been addressed for the outage capacity. This paper is the first of its kind to derive a closed-form analytical solution of outage capacity using fixed decode and forward relaying and amplify and forward relaying in dissimilar Rayleigh fading channels, considering channel coefficients known to the receiver side. The analytical results show a tradeoff between the SNR and the number of relays for specific outage capacity. A comparison between decode and forward relaying and amplify and forward relaying shows that decode and forward relaying outperforms amplify and forward relaying for a large number of relays.

Secure Communication in Multiple Relay Networks Through Decode-and-Forward Strategies

Raef Bassily,Sennur Ulukus,최진영 한국통신학회 2012 Journal of communications and networks Vol.14 No.4

In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decodeand-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays’signals from the eavesdropper’s observation (full ZF), however,the achievable secrecy rate is limited by the worst sourcerelay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.

Link Adaptation and Selection Method for OFDM Based Wireless Relay Networks

Can, Basak,Yomo, Hiroyuki,Carvalho, Elisabeth De The Korea Institute of Information and Commucation 2007 Journal of communications and networks Vol.9 No.2

We propose a link adaptation and selection method for the links constituting an orthogonal frequency division multiplexing (OFDM) based wireless relay network. The proposed link adaptation and selection method selects the forwarding, modulation, and channel coding schemes providing the highest end-to-end throughput and decides whether to use the relay or not. The link adaptation and selection is done for each sub-channel based on instantaneous signal to interference plus noise ratio (SINR) conditions in the source-to-destination, source-to-relay and relay-to-destination links. The considered forwarding schemes are amplify and forward (AF) and simple adaptive decode and forward (DF). Efficient adaptive modulation and coding decision rules are provided for various relaying schemes. The proposed end-to-end link adaptation and selection method ensures that the end-to-end throughput is always larger than or equal to that of transmissions without relay and non-adaptive relayed transmissions. Our evaluations show that over the region where relaying improves the end-to-end throughput, the DF scheme provides significant throughput gain over the AF scheme provided that the error propagation is avoided via error detection techniques. We provide a frame structure to enable the proposed link adaptation and selection method for orthogonal frequency division multiple access (OFDMA)-time division duplex relay networks based on the IEEE 802.16e standard.

Maximum Transmission Rate of PSR/TSR Protocols in Wireless Energy Harvesting DF-Based Relay Networks

MinChul Ju,Kyu-Min Kang,Kyu-Sung Hwang,Cheol Jeong IEEE 2015 IEEE journal on selected areas in communications Vol.33 No.12

<P>In this paper, we consider the power splitting relaying (PSR) and time switching relaying (TSR) protocols for decode-and-forward (DF)-based relay networks consisting of a source, a relay, and a destination. For the networks, the relay is assumed to have a rechargeable battery with a certain amount of remaining energy for energy harvesting through the received signal transmitted from the source. Specifically, for the PSR protocol with and without the direct-path, we present the outage probability expression with a given power splitting coefficient, and we obtain the optimum power splitting coefficient to maximize the transmission rate and derive its transmission rate and outage probability, where the optimum coefficient depends on channel conditions and remaining energy. For the TSR protocol with and without the direct-path, we present the outage probability expression with a given time switching coefficient, and we obtain the optimum time switching coefficient to maximize the transmission rate and derive its transmission rate, where the optimum coefficient also depends on channel conditions and remaining energy.</P>

Switched-Power Two-Layer Superposition Coding in Cooperative Decode-Forward Relay Systems

Xianglan Jin,Hyoung-Nam Kim IEEE 2016 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS Vol.15 No.3

<P>In this paper, we consider a decode-forward relay system with a source, a relay, and a destination, where two-layer superposition codes are used at the source and the relay. An equivalent squared minimum distance (ESMD) that determines the error performance is derived by using an upper bound on the pair-wise error probability. Without deriving error probabilities, the error performance level for each of superimposed symbols can be shown in a straightforward manner by the ESMD. An optimal superposition-coded relay scheme and a suboptimal switched-power superposition coding scheme are proposed by improving the ESMD. Closed-form power allocation that maximizes the ESMD for the switched scheme is derived for 2-ary pulse amplitude modulation (PAM). An M-ary PAM generalization for the switched-power superposition-coded relay scheme is also presented. Simulation results show that significant signal-to-noise ratio gains are achieved in the optimal and switched-power superposition coding strategies for 2-ary and 4-ary PAM over the Rayleigh fading channel.</P>

Resource Allocation Algorithm Based on Simultaneous Wireless Information and Power Transfer for OFDM Relay Networks

( Zhenwei Xie ),( Qi Zhu ),( Su Zhao ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.12

A resource allocation algorithm based on simultaneous wireless information and power transfer (SWIPT) to maximize the system throughput is proposed in orthogonal frequency division multiplexing (OFDM) relay networks. The algorithm formulates the problem under the peak power constraints of the source and each subcarrier (SC), and the energy causality constraint of the relay. With the given SC allocation of the source, we give and prove the optimal propositions of the formulated problem. Then, the formulated problem could be decomposed into two separate throughput maximization sub-problems by setting the total power to transfer energy. Finally, several SC allocation schemes are proposed, which are energy priority scheme, information priority scheme, balanced allocation scheme and exhaustive scheme. The simulation results reveal that the energy priority scheme can significantly reduce computational complexity and achieve approximate performance with the exhaustive scheme.

Maximum Diversity Achieving Decoders in MIMO Decode-and-Forward Relay Systems with Partial CSI

Jin, Xianglan,Kum, Eun-Ji,Lim, Dae-Woon The Korea Institute of Information and Commucation 2014 Journal of communications and networks Vol.16 No.1

We consider multiple-input multiple-output decode-and-forward relay systems in Rayleigh fading channels under the partial channel state information (CSI) that the channel statistics of the source-relay (SR) link and the instantaneous CSI of the source-destination and relay-destination links are known at the destination. In this paper, we propose a new near maximum likelihood (near-ML) decoder with two-level pairwise error probability (near-ML-2PEP) which uses the average PEP instead of the exact PEP. Then, we theoretically prove that the near-ML and near-ML-2PEP decoders achieve the maximum diversity, which is confirmed by Monte Carlo simulations. Moreover, we show that the near-ML-2PEP decoder can also achieve the maximum diversity by substituting the average PEP with the values that represent the error performance of the SR link.