http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Pooi-Yuen Kam (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
Tight Bounds and Invertible Average Error Probability Expressions over Composite Fading Channels
Wang, Qian,Lin, Hai,Kam, Pooi-Yuen The Korea Institute of Information and Commucation 2016 Journal of communications and networks Vol.18 No.2
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.
-
Tight Bounds and Invertible Average Error Probability Expressions over Composite Fading Channels
Qian Wang,Hai Lin,Pooi-Yuen Kam 한국통신학회 2016 Journal of communications and networks Vol.18 No.2
The focus in this paper is on obtaining tight, simplealgebraic-form bounds and invertible expressions for the averagesymbol error probability (ASEP) of M-ary phase shift keying(MPSK) in a class of composite fading channels. We employ themixture gamma (MG) distribution to approximate the signal-tonoiseratio (SNR) distributions of fading models, which includeNakagami-m, Generalized-K (KG), and Nakagami-lognormalfading as specific examples. Our approach involves using the tightupper and lower bounds that we recently derived on the GaussianQ-function, which can easily be averaged over the general MG distribution. First, algebraic-form upper bounds are derived on theASEP of MPSK for M > 2, based on the union upper boundon the symbol error probability (SEP) of MPSK in additive whiteGaussian noise (AWGN) given by a single Gaussian Q-function. Bycomparison with the exact ASEP results obtained by numerical integration,we show that these upper bounds are extremely tight forall SNR values of practical interest. These bounds can be employedas accurate approximations that are invertible for high SNR. Forthe special case of binary phase shift keying (BPSK) (M = 2),where the exact SEP in the AWGN channel is given as one GaussianQ-function, upper and lower bounds on the exact ASEP areobtained. The bounds can be made arbitrarily tight by adjustingthe parameters in our Gaussian bounds. The average of the upperand lower bounds gives a very accurate approximation of the exactASEP. Moreover, the arbitrarily accurate approximations forall three of the fading models we consider become invertible forreasonably high SNR.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
