• Journal of Communications and Networks
• /
• v.18 no.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.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.282-291
• /
• 2008

This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

• Journal of Internet Computing and Services
• /
• v.11 no.5
• /
• pp.1-8
• /
• 2010

This paper presentsthe performance study of blind equalizer algorithms for impulsive-noise environments based on Gaussian kernel and constant modulus error(CME). Constant modulus algorithm(CMA) based on CME and mean squared error(MSE) criterion fails in impulsive noise environment. Correntropy blind method recently introduced for impulsive-noise resistance has shown in PAM system not very satisfying results. It is revealed in theoretical and simulation analysis that the maximization of zero-error probability based on CME(MZEP-CME) originally proposed for Gaussian noise environments produces superior performance in impulsive noise channels as well. Gaussian kernel of MZEP-CME has a strong effect of becoming insensitive to the large differences between the power of impulse-infected outputs and the constant modulus value.

• Korean Journal of Culture and Social Issue
• /
• v.21 no.2
• /
• pp.177-203
• /
• 2015

The aims of this study were 1) to compare irrational gambling beliefs of gamblers and non-gamblers, 2) to investigate the role of cognitive error on winning probability thinking error, and 3) to examine the relationship between attributional bias and gambling behavior. A total of 248 subjects were recruited for this study. All subjects were classified into non-gamblers, social gamblers and pathological gamblers, and administered self-report questionnaires to measure irrational gambling beliefs, the probability inference error, the attriburional style, and the attributional bias. A pathological gambler group scored highest on irrational gambling beliefs, especially the overestimation of self-ability factor, and a social gambler group and a non-gambler group follow. All three groups scored higher on the magnification of gambling skills than the mean (4.0) of the scale. Pathological gamblers and social gamblers scored higher on the probability thinking error than non-gamblers. Pathological gamblers displayed higher external attribution, lower internal attribution in their daily life events and higher internal attribution in failure situation than social gamblers and non-gamblers. The results indicate that cognitive errors would be a factor that differentiates pathological gamblers from social gamblers and non-gamblers. In predicting gambling behaviors, overestimation of self-ability of irrational gambling beliefs, internal attribution in failure situation, external attribution in daily live event, and probability thinking error were identified as significant factors. It is concluded that a public education about common cognitive bias featured in gamblers might be important in prevention of pathological gambling behaviors.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.827-838
• /
• 1999

멀티미디어 통신에서 통신 성능에 관련된 요구 사항들은 QoS 매개 변수들로서 서술된다. QoS매개 변수들에서 중요한 매개 변수 중의 하나가 전송 신뢰성이다. QoS 매개 변수로서의 신뢰성은 오류 감지, 보고 그리고 정정 기법으로 정의된다. 하지만 기존의 오류 제어 기법들은 멀티미디어 데이타의 통합된 관점을 고려하지 않았다. 그래서 우리는 MEC(multimedia-oriented error control)라고 명명된 오류 제어 기법을 제안하였다. 1 본 논문에서는 MEC기법의 성능을 조사 하였다. 성능평가 결과는 MEC기법이 기존의 오류 제어 기법보다도 낮은 전송지연(lower delay)과 호손율(blocking probability) 을 갖는다는 것을 볼 수 있었다. 결국 제안된 MEC기법은 수송 프로토콜에게 유연성과 높은 성능을 갖도록 해준다.Abstract Communication performance requirements are described as QoS parameters in multimedia communication. One of the important QoS parameters is the reliability of the transfer. As a QoS parameter, the reliability defines error detection, report and correction mechanisms. Conventional error control mechanisms, however, do not consider the integrated viewpoint of multimedia data. So we have proposed the MEC(multimedia-oriented error control). 1 In this paper, we have investigated the performance evaluation of the MEC. The results show that the MEC mechanism provides lower transfer delay and blocking probability than those of the conventional error recovery mechanism. Therefore, the proposed MEC mechanism makes the transport protocol have the flexibility and high performance.

• Journal of IKEEE
• /
• v.15 no.3
• /
• pp.198-204
• /
• 2011

In this letter, another analytical approach for the opportunistic amplify-and-forward (OAF) relay systems is proposed over Rayleigh fading channels. Based on set-operation at the selected relay node, its selection probability as the best relay is derived and then, the probability density function (PDF) of the received instantaneous signal-to-noise ratio (SNR) is expressed as a more tractable form in which the number of summations and the length of each summation are specified. Then, the average error rate, outage probability, and average channel capacity are obtained as approximated closed-forms. Simulation results are finally presented to validate that the proposed analytical expressions can be a unified frame work covering all Rayleigh fading channel conditions. Furthermore, it is confirmed that OAF schemes can outperform the other non-selective schemes on the average error rate, outage probability, and average channel capacity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.527-534
• /
• 2002

In this paper, efficiency in the acquisition of the PN code of the DS/CDMA system was analyzed by using the Nakagami-m probability density function that can model diverse fading channels. The system considers the fading environment that inevitably exists in the mobile communications channel environment. To analyze the efficiency of the system, the equations related to detection probability PD and false alarm probability PFA required for the acquisition of the PN code were induced by using the Nakagami-m probability density function. They were verified through simulation. For the DS/CDMA system an adaptive serial search technique was applied to acquire the PN code. To correct phase error, the equations related to detection probability PD and false alarm probability PFA that influence the time to acquire codes were induced after adding the PLL to each branch of the Rake Receiver. By using an induced equation, detection probability PD and false alarm probability PFA were verified through simulation.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.149-152
• /
• 2000

In this paper, the reverse link performance of an imperfect power controlled DS/CDMA cellular system that uses a base station array antenna which can effectively remove the multiple access interference is analyzed considering both beam forming algorithm and power control error in shadowing. The blocking probability of the DS/CDMA cellular system based on array parameters, Eb/No and statistics of interference is derived, and then the system capacity corresponding to a certain blocking probability is calculated. On the assumption that the blocking probability is set 1 ％, the system capacity using MCGM algorithm with 12 antenna arrays is increased about 59 % than that using 8 antenna arrays when power control error is 2.5 ㏈.

• Journal of Korea Society of Industrial Information Systems
• /
• v.2 no.2
• /
• pp.219-228
• /
• 1997

The Fano metric is the maximum likelihood decoding choice for convlutional code for binary symmetric channel. The Fano metric assumes that it has previous knowledge of channel error probability. However, the bit errors in real channel occur in bursts and the channel error probability can not be known exactly. Thus, the Fano metric is not the maximum likelihood choice for bursty-noise channel. In this paper universal metri which dose not require the previous knowlege of the channel transition probability is used for sequential decoding. It is shown that the complexity of the universal is much less than that of the Fano metric bursty-noise channel, since it is estimated on a branch by branch basis.

• Journal of Information Processing Systems
• /
• v.10 no.3
• /
• pp.459-470
• /
• 2014

In this paper, the average probability of the symbol error rate (SER) and throughput are studied in the presence of joint spectrum sensing and data transmission in a cognitive relay network, which is in the environment of an optimal power allocation strategy. In this investigation, the main component in calculating the secondary throughput is the inclusion of the spatial false alarms, in addition to the conventional false alarms. It has been shown that there exists an optimal secondary power amplification factor at which the probability of SER has a minimum value, whereas the throughput has a maximum value. We performed a Monte-Carlo simulation to validate the analytical results.