• 전자공학회논문지SC
• /
• 제46권1호
• /
• pp.55-62
• /
• 2009

본 논문에서 증폭 후 전달 전송 기법을 사용하는 중계망의 채널 추정을 하는데 있어서 일어나는 문제점을 해결할 수 있는 방법으로 학습 계열(training sequence)을 이용하는 방법을 제안하였다. 현재의 고속 페이딩 채널 환경에서 기존 파일럿의 추정이 적절하지 않아 송신국(source)과 중계국(relay) 사이의 채널과 중계국(relay)과 수신국(destination) 사이의 채널을 결합하여 추정할 경우 많은 문제점이 초래되기에$^{[1{\sim}2]}$ 전송한 신호의 주파수 영역을 선택하여 얻은 정규(Gaussian) 분포에 대하여 최대 우도 함수의 평균을 내어 채널 추정량(estimator)을 유도해 낼 수 있는, 즉, 파일럿 대신에 하나의 OFDM 신호를 사용하여 모든 채널 충격 응답(CIR)을 추정할 수 있는 새로운 방법을 살펴보았다. 컴퓨터 모의실험으로 높은 SNR 영역에서 제안한 채널 추정기(estimator)의 성능이 [1]과 비교하여 약 1dB 정도 높음을 확인할 수 있었다.

• 한국통신학회논문지
• /
• 제34권7A호
• /
• pp.530-539
• /
• 2009

Wireless Relaying is a promising solutions to overcome the channel impairments and provides high data rate coverage that appear for beyond 3G mobile communications. In this paper we present end to end BER performance of dual hop wireless communication systems equipped with multiple Decode and Forward relays over Rayleigh fading channel with the best relay selection. We compare the BER performance of the best relay with the BER performance of single relay. We select the best relay based on the end to end channel conditions. We further calculate the outage probability of the best relay. It is shown that the outage probability of the best relay is equivalent to the outage probability when all relays take part in the transmission. We apply Orthogonal Space Time Block coding(OSTBC) at the source terminal. Numerical and simulation results are presented to verify our analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.4087-4102
• /
• 2014

Two-way relaying is an effective way of improving system spectral efficiency by making use of physical layer network coding. However, energy efficiency in OFDM-based bidirectional relaying with asymmetric traffic requirement has not been investigated. In this study, we focused on subcarrier transmission mode selection, bit loading, and power allocation in a multicarrier single amplified-and-forward relay system. In this scheme, each subcarrier can operate in two transmission modes: one-way relaying and two-way relaying. The problem is formulated as a mixed integer programming problem. We adopt a structural approximation optimization method that first decouples the original problem into two suboptimal problems with fixed subcarrier subsets and then finds the optimal subcarrier assignment subsets. Although the suboptimal problems are nonconvex, the results obtained for a single-tone system are used to transform them to convex problems. To find the optimal subcarrier assignment subsets, an iterative algorithm based on subcarrier ranking and matching is developed. Simulation results show that the proposed method can improve system performance compared with conventional methods. Some interesting insights are also obtained via simulation.

• 한국인터넷방송통신학회논문지
• /
• 제11권3호
• /
• pp.53-58
• /
• 2011

통신 시스템에서 수신 성능을 향상시키는 방법으로 MIMO 기술이 활발히 연구되고 있다. 하지만 최근 소형화되어 가는 대부분의 무선 단말기는 사이즈, 비용, 하드웨어의 복잡성 등의 이유로 적용할 수 있는 안테나의 개수에 한계를 가진다. 이에 따라 개발된 협력통신은 단일 안테나를 가지는 다수의 단말기들이 가상의 MIMO 환경을 구현함으로써 다이버시티 이득을 얻을 수 있다. 하지만 협력통신은 다이버시티를 얻기 위해 스펙트럼 효율성을 저하시키며, 이를 극복할 수 있는 방법으로 증분 중계기법을 이용한다. 본 논문에서는 증분 중계기법을 이용하는 다양한 시스템 모델을 고려하며, 고려된 시스템 모델이 최적의 성능을 얻을 수 있는 중계기 위치를 연구한다.

• Journal of Communications and Networks
• /
• 제11권5호
• /
• pp.433-444
• /
• 2009

The bi-directional relay channel is the natural extension of a three-terminal relay channel where node a transmits to node b with the help of a relay r to allow for two-way communication between nodes a and b. That is, in a bi-directional relay channel, a and b wish to exchange independent messages over a shared channel with the help of a relay r. The rates at which this communication may reliably take place depend on the assumptions made on the relay processing abilities. We overview information theoretic limits of the bi-directional relay channel under a variety of conditions, before focusing on half-duplex nodes in which communication takes place in a number of temporal phases (resulting in protocols), and nodes may forward messages in four manners. The relay-forwarding considered are: Amplify and forward (AF), decode and forward (DF), compress and forward (CF), and mixed forward. The last scheme is a combination of CF in one direction and DF in the other. We derive inner and outer bounds to the capacity region of the bi-directional relay channel for three temporal protocols under these four relaying schemes. The first protocol is a two phase protocol where a and b simultaneously transmit during the first phase and the relay r alone transmits during the second. The second protocol considers sequential transmissions from a and b followed by a transmission from the relay while the third protocol is a hybrid of the first two protocols and has four phases. We provide a comprehensive treatment of protocols in Gaussian noise, obtaining their respective achievable rate regions, outer bounds, and their relative performance under different SNR and relay geometries.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권9호
• /
• pp.1513-1527
• /
• 2011

This paper investigates the capacity rate problems for a joint decode-and-forward (JDF) based two-way relaying with network coding. We first characterize the achievable rate region for a conventional three-node network scenario along with the calculation of the corresponding maximal sum-rate. Then, for the goal of maximizing the system sum-rate, opportunistic relay selection is examined for multi-relay networks. As a result, a novel strategy for the implementation of relay selection is proposed, which depends on the instantaneous channel state and allows a single best relay to help the two-way information exchange. The JDF scheme and the scheme using relay selection are analyzed in terms of outage probability, after which the corresponding exact expressions are developed over Rayleigh fading channels. For the purpose of comparison, outage probabilities of the amplify-and-forward (AF) scheme and those of the scheme using relay selection are also derived. Finally, simulation experiments are done and performance comparisons are conducted. The results verify that the proposed strategy is an appropriate method for the implementation of relay selection and can achieve significant performance gains in terms of outage probability regardless of the symmetry or asymmetry of the channels. Compared with the AF scheme and the scheme using relay selection, the conventional JDF scheme and that using relay selection perform well at low signal-to-noise ratios (SNRs).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1111-1130
• /
• 2016

Cooperative communications can significantly improve the wireless transmission performance with the help of relay nodes. In cooperative communication networks, relay selection and power allocation are two key issues. In this paper, we propose a relay selection and power allocation scheme RS-PA-PSACO (Relay Selection-Power Allocation-Particle Swarm Ant Colony Optimization) based on PSACO (Particle Swarm Ant Colony Optimization) algorithm. This scheme can effectively reduce the computational complexity and select the optimal relay nodes. As one of the swarm intelligence algorithms, PSACO which combined both PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) algorithms is effective to solve non-linear optimization problems through a fast global search at a low cost. The proposed RS-PA-PSACO algorithm can simultaneously obtain the optimal solutions of relay selection and power allocation to minimize the SER (Symbol Error Rate) with a fixed total power constraint both in AF (Amplify and Forward) and DF (Decode and Forward) modes. Simulation results show that the proposed scheme improves the system performance significantly both in reliability and power efficiency at a low complexity.

• ETRI Journal
• /
• 제38권5호
• /
• pp.941-951
• /
• 2016

In this paper, cognitive radio and simultaneous wireless information and power transfer (SWIPT) are effectively combined to design a spectrum-efficient and energy-efficient transmission paradigm. Specifically, a novel SWIPT-based primary-secondary cooperation model is proposed to increase the transmission rate of energy/spectrum constrained users. In the proposed model, a multi-antenna secondary user conducts simultaneous energy harvesting and information forwarding by means of power splitting (PS), and tries to maximize its own transmission rate under the premise of successfully assisting the data delivery of the primary user. After the problem formulation, joint power splitting and beamforming optimization algorithms for decode-and-forward and amplify-and-forward modes are presented, in which we obtain the optimal PS factor and beamforming vectors using a golden search method and dual methods. Simulation results show that the proposed SWIPTbased primary-secondary cooperation schemes can obtain a much higher level of performance than that of non-SWIPT cooperation and non-cooperation schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.989-1005
• /
• 2010

Cooperative diversity is a technique with which a virtual multiple antenna array is established among the single antenna users of the wireless network to realize space diversity. Signal space diversity (SSD) is a bandwidth-efficient diversity technique, which uses constellation rotation and interleaving techniques to achieve diversity gain. A new cooperative diversity scheme with rotated constellations (RCCD) is proposed in this paper. In this scheme, data are modulated by using a rotated constellation, and the source and the relays transmit different components of the modulated symbols. Since any one of the components contains full information of the symbols, the destination can obtain multiple signals conveying the same information from different users. In this way, space diversity is achieved. The RCCD scheme inherits the advantage of SSD - being bandwidth-efficient but without the delay problem of SSD brought by interleaving. The symbol error rate of the RCCD scheme is analyzed and simulated. The analysis and simulation results show that the RCCD scheme can achieve full diversity order of two when the inter-user channel is good enough, and, with the same bandwidth efficiency, has a better performance than amplify-and-forward and detect-and-forward methods.