• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2416-2432
• /
• 2017

In this paper, we investigate the security performance for cooperative networks over Nakagami-m fading channels. Based on whether the channel state information (CSI) of wiretap link is available or not, optimal relay selection (ORS) and suboptimal relay selection (SRS) schemes are considered. Also, multiple relays combining (MRC) scheme is considered for comparison purpose. The exact and asymptotic closed-form expressions for secrecy outage probability (SOP) are derived and simulations are presented to validate the accuracy of our proposed analytical results. The numerical results illustrate that the ORS is the best scheme and SRS scheme is better than MRC scheme in some special scenarios such as when the destination is far away from the relays. Furthermore, through asymptotic analysis, we obtain the closed-form expressions for the secrecy diversity order and secrecy array gain for the three different selection schemes. The secrecy diversity order is closely related to the number of relays and fading parameter between relay and destination.

• 융합신호처리학회논문지
• /
• 제10권2호
• /
• pp.136-140
• /
• 2009

The performances of M-ary signals using L-branch maximum ratio combining (MRC) diversity reception in correlated Nakagami fading channels are derived theoretically. The coherent reception of M-ary differential phase shift keying (MDPSK), phase shift keying (MPSK), and quadrature amplitude modulation (MQAM) is considered. It is assumed that the fading parameters in each diversity branch are identical. The general formula for evaluating symbol error rate (SER) of M-ary signals in the independent branch diversity system is presented using the integral-form expressions. Until now, results did not extend to the various M-ary case for a coherent reception. The numerical results presented in this paper are expected to provide information for the design of radio system using M-ary modulation method for above mentioned channel environment.

• Journal of Communications and Networks
• /
• 제18권2호
• /
• pp.182-189
• /
• 2016

The focus in this paper is on obtaining tight, simple algebraic-form bounds and invertible expressions for the average symbol error probability (ASEP) of M-ary phase shift keying (MPSK) in a class of composite fading channels. We employ the mixture gamma (MG) distribution to approximate the signal-to-noise ratio (SNR) distributions of fading models, which include Nakagami-m, Generalized-K ($K_G$), and Nakagami-lognormal fading as specific examples. Our approach involves using the tight upper and lower bounds that we recently derived on the Gaussian Q-function, which can easily be averaged over the general MG distribution. First, algebraic-form upper bounds are derived on the ASEP of MPSK for M > 2, based on the union upper bound on the symbol error probability (SEP) of MPSK in additive white Gaussian noise (AWGN) given by a single Gaussian Q-function. By comparison with the exact ASEP results obtained by numerical integration, we show that these upper bounds are extremely tight for all SNR values of practical interest. These bounds can be employed as accurate approximations that are invertible for high SNR. For the special case of binary phase shift keying (BPSK) (M = 2), where the exact SEP in the AWGN channel is given as one Gaussian Q-function, upper and lower bounds on the exact ASEP are obtained. The bounds can be made arbitrarily tight by adjusting the parameters in our Gaussian bounds. The average of the upper and lower bounds gives a very accurate approximation of the exact ASEP. Moreover, the arbitrarily accurate approximations for all three of the fading models we consider become invertible for reasonably high SNR.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권3호
• /
• pp.799-818
• /
• 2014

Spectrum sensing is a key technical challenge for cognitive radio (CR). It is well known that multi-cycle cyclostationarity (MC) detector is a powerful method for spectrum sensing. However, conventional MC detector is difficult to implement due to its high computational complexity. This paper pays attention to the fact that the computation complexity can be reduced by simplifying the test statistic of conventional MC detector. Based on this simplification process, an improved MC detector is proposed. Compared with the conventional one, the proposed detector has the low-computational complexity and sufficient-accuracy on sensing performance. Subsequently, the sensing performances are further investigated for the cases of Rayleigh, Nakagami-m, Rician, composite Rayleigh fading-lognormal shadowing and composite Nakagami fading-lognormal shadowing channels, respectively. Furthermore, the square-law combining (SLC) is introduced to improve the detection capability over fading-shadowing channels. The corresponding closed-form expressions of average detection probability are derived for each case by the moment generation function (MGF) approach. Finally, illustrative and analytical results show that the efficiency and reliability of proposed detector and the improvement on sensing performance by SLC over composite fading-shadowing channels.

• 한국정보통신학회논문지
• /
• 제15권8호
• /
• pp.1797-1804
• /
• 2011

본 논문에서는 주변 환경에 따라 다양한 채널 상태를 나타낼 수 있는 분산형 나카가미 페이딩 채널하에서 선형의 시공간 블록코드 (Space-Time Block Code) 직교 설계로부터 평균 비트 에러율(Bit Error Rate)성능을 평가하여 MIMO(Multiple Input Multiple Output) 채널의 안테나 열 구성과 동작환경의 영향을 분석하였고 향상된 BER을 위한 MT 안테나의 설계조건과 페이딩 지수 m을 제안 한다. 시스템 성능의 분석을 위해 M-PSK(M-ary Phase Shift Keying)변조 방식과, M-QAM(M-ary Quadra -ture Amplitude Modulation)변조 방식을 사용 하였고, 분석 식은 각각 적분된 나카가미 페이딩 변수와 적분되지 않은 나카가미 페이딩 변수로부터 시스템의 성능을 비교 분석하였다. 채널 배열의 구성은 행렬의 수식적 계산에 의해 얻게 되며, AOA 확산이 감소하는 것에 따라 STBC(Space - Time Block Codes) BER성능이 감소하며, 이와 같은 손실은 안테나 간격의 증가나, 배열구성의 변경을 통해 보상 될 수 있다.

• ETRI Journal
• /
• 제36권1호
• /
• pp.22-30
• /
• 2014

Recently, efficient partial relay selection (e-PRS) was proposed as an enhanced version of PRS. In comparing e-PRS, PRS, and the best relay selection (BRS), there is a tradeoff between complexity and performance; that is, the complexity for PRS, e-PRS, and BRS is low to high, respectively, but vice versa for performance. In this paper, we study the outage probability for e-PRS in decode-and-forward (DF) relaying systems over non-identical Nakagami-m fading channels, where the fading parameter m is an integer. In particular, we provide closed-form expressions of the exact outage probability and asymptotic outage probability for e-PRS in DF relaying systems. Numerical results show that e-PRS achieves similar outage performance to that of BRS for a low or medium signal-to-noise ratio, a high fading parameter, a small number of relays, and a large difference between the average channel powers for the first and the second hops.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.213-214
• /
• 2008

In this paper, we analyze the performance of a cooperative communication wireless network over independent and identically distributed (IID) Nakagami-m fading channels. A simple transmission scheme is considered where the relay is operating in amplify-forward (AF) mode. A closed-form expression for symbol error rate (SER) is obtained using the moment generating function (MGF) of the total signal to noise ratio (SNR) of the transmitted signal with binary phase shift keying (BPSK).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권12호
• /
• pp.3003-3017
• /
• 2013

In this paper, we investigate the outage performance of a cognitive relay network. We consider mutual interference in an independent, non-identically distributed Nakagmai-m fading environment. We first derive the close-form outage probability expression, which provides an efficient means to evaluate the effects of several parameters. This allows us to study the impact of several parameters on the network's performance. We then derive the asymptotic expression and reveal that the diversity order is strictly determined by the fading severity of the cognitive system. It is not affected by the primary network. Moreover, the primary network only affects the coding gain of the cognitive system. Finally, Monte Carlo simulations are provided, which corroborate the analytical results.

• 한국컴퓨터정보학회논문지
• /
• 제11권5호
• /
• pp.195-201
• /
• 2006

MC-CDMA의 전체 시스템 대역폭은 부대역으로 분할되며, 각 부대역은 직접시권스확산을 사용하고 각 부대역 신호는 부캐리어 주파수를 사용하여 전송한다. 본 논문에서는 주파수 선택적 나까카미-m 페인팅 채널에서 동이득 합성법과 최대비 합성법을 사용한 MC-CDMA시스템 성능을 분석한다. 본 논문에서 제안된 시스템은 데이터 스트림을 직렬에서 병렬로 변환하여, 각 병렬 데이터 스트림을 MC-CDMA시스템에 사용한다. 데이터 스트림은 송신기에서 칩 레벨과 심볼 프락션 레벨을 확산시킨다. 본 논문에서는 동 이득 합성과 최대비 합성 두가지 다이버시티 합성법을 비교분석하였다. 동이득 합성법 보다 최대비 합성법을 사용한 시스템 성능이 우월하였다.

• 전자공학회논문지S
• /
• 제36S권8호
• /
• pp.8-16
• /
• 1999

본 논문에서는 다중톤 방해신호가 존재하는 나카가미 페이디 전송로에서 BPSK 변조 및 동기검출을 이용하는 직접시퀀스/느린 주파수 도약(DS/SFH) 복합 확산대역 시스템의 성능을 분석한다. 나카가미 페이딩 전송로 모델은 페이딩 지수 m에 따라 다양한 전파환경을 표현할 수 있는 장점을 지니는데, m=1이면 레일레이 페이딩 분포를 나타내고, $1/2{\le}m{\le}1$이면 레일레이 페이딩보다 심한 페이딩을 나타낸다. m>1이면 라이시안 페이딩을 나타내고, m이 무한대로 감에 따라 페이딩이 없는 조건을 나타낸다. 본 논문은 이 모델을 근거로 복합 확산대역 시스템의 비트오율식을 유도하고, 여러가지 시스템 파라미터에 대하여 계산한 결과를 제시한다. 계산결과로부터 m이 증가함에 따라 페이딩의 영향은 줄어들고 이에 따라 더 좋은 성능을 나타내는 것을 알 수 있으며, 방해신호대 원하는 신호의 전력비(JSR)가 작은 경우에는 DS 확산대역 시스템의 성능이 DS/SFH 복합 확산대역 시스템보다 좋은 성능을 나타내지만, 방해신호대 원하는 신호의 전력비(JSR)가 큰 경우에는 DS/SFH 복합확산대역 시스템의 성능이 DS 확산대역 시스템 성능보다 더 우수하다. 결론적으로, 전체 대역폭을 일정하게 유지할 경우, 다중톤 방해신호가 존재하는 환경에서 DS/SFH 복합 확산대역 시스템의 성능이 DS확산대역 시스템의 성능보다 훨씬 더 우수함을 알 수 있다.