• Title/Summary/Keyword: DF Relay

Search Result 87, Processing Time 0.018 seconds

Exact Average BER Analysis for Decoded-and-Forward Relay Systems (복호 후 전달 릴레이 시스템에 대한 정확한 평균 오류율 분석)

  • Jang, Jean-Yeong;Ko, Kyun-Byoung
    • Proceedings of the KAIS Fall Conference
    • /
    • 2010.11a
    • /
    • pp.16-19
    • /
    • 2010
  • 본 논문에서는 송신국과 릴레이에서의 오류확률을 고려한 복호 후 전달 릴레이(DF: Decoded and Forward) 시스템에 대하여 정확한 비트 오류율 분석을 수행하고자 한다. 성능 분석에서는 복호 후 전달 릴레이 시스템의 노드들 간의 채널을 상호 독립적인 레일리 페이딩 채널로 가정하고 변조 방식으로는 BPSK(Binary Phase Shift Keying)를 사용한다. 우선, 정확한 평균 오류율 분석을 위하여 송신국-수신국 링크와 릴레이-수신국 링크 결합시 릴레이노드의 복호결과 오류 유무에 따라 수신 SNR(Signal to Noise Ratio)을 각각 유도하고 복호결과가 오류일 때 수신 SNR이 양수인 경우와 음수인 경우를 고려하여 그에 대한 PDF(Probability Density Function)를 계산한다. 그리고 각각의 경우에 대한 평균 오류율을 유도하였다. 또한 모의실험 결과와의 비교를 통하여 제안된 성능 분석 기법의 정확성을 검증하였다.

  • PDF

Application of information theory to wireless cooperative communications (정보이론의 협력무선통신에의 응용)

  • Kim, Yoon-Hyun;Yang, Jae-Soo;Ha, Kwang-Jun;Kim, Jin-Young
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.337-343
    • /
    • 2009
  • Information theory is one field of the applied mathematics quantitating the data in order to store data as many as in the medium or communicate through channel. it was released on the Shannon's paper, in 1948. With basis on this paper, It has been achieved dramatically development for communication, signal processing, and date procedure and transmission in the network In this paper, the basic concept of information theory is described through dealing with contents about meaning of information, entropy, and channel capacity. It is also handled how information theory is applied to the fields of sensor network, relay channel, MIMO system, and others.

  • PDF

Throughput-Reliability Tradeoff in Decode-and-Forward Cooperative Relay Channels: A Network Information Theory Approach

  • Li, Jun;Chen, Wen
    • Journal of Communications and Networks
    • /
    • v.11 no.5
    • /
    • pp.445-454
    • /
    • 2009
  • Cooperative transmission protocols are always designed to achieve the largest diversity gain and the network capacity simultaneously. The concept of diversity-multiplexing tradeoff (DMT) in multiple input multiple output (MIMO) systems has been extended to this field. However, DMT constrains a better understanding of the asymptotic interplay between transmission rate, outage probability (OP) and signal-to-noise ratio. Another formulation called the throughput-reliability tradeoff (TRT) was then proposed to avoid such a limitation. By this new rule, Azarian and Gamal well elucidated the asymptotic trends exhibited by the OP curves in block-fading MIMO channels. Meanwhile they doubted whether the new rule can be used in more general channels and protocols. In this paper, we will prove that it does hold true in decode-and-forward cooperative protocols. We deduce the theoretic OP curves predicted by TRT and demonstrate by simulations that the OP curves will asymptotically overlap with the theoretic curves predicted by TRT.

Distributed Matching Algorithms for Spectrum Access: A Comparative Study and Further Enhancements

  • Ali, Bakhtiar;Zamir, Nida;Ng, Soon Xin;Butt, Muhammad Fasih Uddin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1594-1617
    • /
    • 2018
  • In this paper, we consider a spectrum access scenario which consists of two groups of users, namely Primary Users (PUs) and Secondary Users (SUs) in Cooperative Cognitive Radio Networks (CCRNs). SUs cooperatively relay PUs messages based on Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative techniques, in exchange for accessing some of the spectrum for their secondary communications. From the literatures, we found that the Conventional Distributed Algorithm (CDA) and Pragmatic Distributed Algorithm (PDA) aim to maximize the PU sum-rate resulting in a lower sum-rate for the SU. In this contribution, we have investigated a suit of distributed matching algorithms. More specifically, we investigated SU-based CDA (CDA-SU) and SU-based PDA (PDA-SU) that maximize the SU sum-rate. We have also proposed the All User-based PDA (PDA-ALL), for maximizing the sum-rates of both PU and SU groups. A comparative study of CDA, PDA, CDA-SU, PDA-SU and PDA-ALL is conducted, and the strength of each scheme is highlighted. Different schemes may be suitable for different applications. All schemes are investigated under the idealistic scenario involving perfect coding and perfect modulation, as well as under practical scenario involving actual coding and actual modulation. Explicitly, our practical scenario considers the adaptive coded modulation based DF schemes for transmission flexibility and efficiency. More specifically, we have considered the Self-Concatenated Convolutional Code (SECCC), which exhibits low complexity, since it invokes only a single encoder and a single decoder. Furthermore, puncturing has been employed for enhancing the bandwidth efficiency of SECCC. As another enhancement, physical layer security has been applied to our system by introducing a unique Advanced Encryption Standard (AES) based puncturing to our SECCC scheme.

Hybrid Spectrum Sharing with Cooperative Secondary User Selection in Cognitive Radio Networks

  • Kader, Md. Fazlul;Asaduzzaman, Asaduzzaman;Hoque, Md. Moshiul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.9
    • /
    • pp.2081-2100
    • /
    • 2013
  • In this paper, we propose a cooperative hybrid spectrum sharing protocol by jointly considering interweave (opportunistic) and underlay schemes. In the proposed protocol, secondary users can access the licensed spectrum along with the primary system. Our network scenario comprises a single primary transmitter-receiver (PTx-PRx) pair and a group of M secondary transmitter-receiver (STx-SRx) pairs within the transmission range of the primary system. Secondary transmitters are divided into two groups: active and inactive. A secondary transmitter that gets an opportunity to access the secondary spectrum is called "active". One of the idle or inactive secondary transmitters that achieves the primary request target rate $R_{PT}$ will be selected as a best decode-and-forward (DF) relay (Re) to forward the primary information when the data rate of the direct link between PTx and PRx falls below $R_{PT}$. We investigate the ergodic capacity and outage probability of the primary system with cooperative relaying and outage probability of the secondary system. Our theoretical and simulation results show that both the primary and secondary systems are able to achieve performance improvement in terms of outage probability. It is also shown that ergodic capacity and outage probability improve when the active secondary transmitter is located farther away from the PRx.

Exact BER Expressions for Decode-and-Forward Relaying in Rayleigh Fading Channels (레일레이 페이딩 채널에서 디코팅 후 전달 중계방식에 대한 비트 오차율 분석)

  • Lee, In-Ho;Kim, Dong-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1244-1250
    • /
    • 2007
  • User cooperation provides high reliability in wireless communication systems by employing relay nodes to transmit the same information. In this paper, a bit error rate (BER) study is presented for decode-and-forward (DF) relaying for user cooperation in independent and identically distributed Rayleigh fading channels. For an arbitrary number of relays, exact and closed-form expressions of the BER are proposed for M-ary PAM (Pulse Amplitude Modulation), QAM (Quadrature Amplitude Modulation) and PSK (Phase Shift Keying), respectively. It is also shown that the analytic results are perfectly matched with the simulated ones.

Efficient Synchronization Scheme for Cooperative Communication System over Fading Channel (페이딩 환경에서의 효율적인 협력통신 시스템 동기 알고리즘 연구)

  • Kim, Yoon-Hyun;Kim, Jin-Young
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.2
    • /
    • pp.64-68
    • /
    • 2010
  • In this paper, we studied the novel synchronization algorithm for cooperative communication system over fading. We research mainly on the decode-and-forward scheme. Also, we inserted spreading sequence in origin data frame to control efficiently data synchronization. In mobile station, inserted spreading sequence in data frame passed through the corelation process. We had decide the delay value of received data through result of correlation process. In simulation, We applied that channel gain of three node had different value in various fading environment. Finally we will be possible to control the received data synchronization using result of corelation value in each node between relay to mobile station and base station to mobile station. The results of this paper can be applicable to the cooperative systems.