• ETRI Journal
• /
• 제31권3호
• /
• pp.345-347
• /
• 2009

This letter presents an alternative analytical expression for computing the probability of an M-ary phase shift keying (MPSK) wedge-shaped region in an additive white Gaussian noise channel. The expression is represented by the cumulative distribution function of known noncentral F-distribution. Computer simulation results demonstrate the validity of our analytical expression for the exact computation of the symbol error probability of an MPSK system with phase error.

• ETRI Journal
• /
• 제30권4호
• /
• pp.609-611
• /
• 2008

We address the outage performance for the opportunistic amplify-and-forward relaying strategies under Nakagami-m fading channels. A closed-form expression for the outage probability is derived. Simulation results verify our theoretical solutions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제6권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.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• 제11권3호
• /
• pp.352-357
• /
• 2000

The symbol error probability for the coherent detection of MPSK signals in additive white Gaussian noise(AWGN) can be evaluated exactly for M=2 and M=4. The MPSK symbol error probability bounds obtained in the past are simple to calculate, but not accurate. More recently, very tight bounds have been proposed, but they are complex to calculate. In this paper to obtain a simple and accurate lower bound for coherent MPSK symbol error probability in AWGN, we consider the symbol error probability for MPSK in Nakagami fading case first. Then as the Nakagami fading index m approaches to infinity, we obtain the symbol error probability for the MPSK in AWGN.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• 제16권3호
• /
• pp.41-53
• /
• 2013

The study for the estimation potential natural vegetation was estimated the occurrence probability distribution using geographic information system(GIS) in Bukhansan National Park. Correlation and factor analysis were analyzed to estimate probability distribution. Coefficients were calculated by logistic regression analysis. Correlation coefficients were significantly at the 0.01 level. Commonality of elevation, annual mean temperature, warmth index and potential evapotranspiration were high value, but topographic index was low value. Communities of over the 0.3 points distribution probability, Quercus mogolica communities were the largest area, 76,940,900 $m^2$, Pinus densiflora communities area was 860,800 $m^2$, Quercus acutissima communities area was 500,100 $m^2$ and Quercus variabilis communities area was 1,000 $m^2$, but Q. aliena, Q. serrata, Carpinus laxiflora and Zelcova serrata communities was not appeared. Therefore, potential national vegetation of Bukhansan national park was likely to be Q. mongolica community, P. densiflora community, Q. acutissima community and Q. variabilis community.

• ETRI Journal
• /
• 제32권3호
• /
• pp.422-429
• /
• 2010

We present guaranteed dynamic priority assignment schemes for multiple real-time tasks subject to (m, k)-firm deadlines. The proposed schemes have two scheduling objectives: providing a bounded probability of missing (m, k)-firm constraints and maximizing the probability of deadline satisfactions. The second scheduling objective is especially necessary in order to provide the best quality of service as well as to satisfy the minimum requirements expressed by (m, k)-firm deadlines. We analytically establish that the proposed schemes provide a guarantee on the bounded probability of missing (m, k)-firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed schemes with regard to their scheduling objectives.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1033-1047
• /
• 2009

In this paper, we consider a m-type risk model with Markov-modulated premium rate. A integral equation for the conditional ruin probability is obtained. A recursive inequality for the ruin probability with the stationary initial distribution and the upper bound for the ruin probability with no initial reserve are given. A system of Laplace transforms of non-ruin probabilities, given the initial environment state, is established from a system of integro-differential equations. In the two-state model, explicit formulas for non-ruin probabilities are obtained when the initial reserve is zero or when both claim size distributions belong to the $K_n$-family, n $\in$ $N^+$ One example is given with claim sizes that have exponential distributions.

• Journal of Wetlands Research
• /
• 제21권4호
• /
• pp.298-304
• /
• 2019

In this paper, the analytical method to derive wind fragility for urban street tree in Korea was shown. Monte Carlo Simulation method was used to determine the probability of failure for urban street tree. This probability result was used to determine wind fragility parameters for four types of tree based on the study of street tree species in urban area in Daegu, Korea. Wind fragility for street tree was presented in terms of median capacity and standard deviation of the natural logarithm of the capacity. Results showed that the dominant factor affecting the probability of failure of tree under wind load was their diameter. Moreover, amongst the four types of tree chosen, the tree with height 7m and diameter 35cm had the lowest probability of failure under wind loading, whereas the tree with height 8m and diameter 30cm could resist the least wind loading. The median failure wind speed for urban street tree with height 7m were 43.8m/s and 50.6m/s for diameter 30cm and 35cm, respectively. Also, for tree with height 8m, their median failure wind speeds were 38.7m/s and 45.4m/s for tree with diameter 30cm and 35cm, respectively.

• IEIE Transactions on Smart Processing and Computing
• /
• 제2권2호
• /
• pp.67-76
• /
• 2013

Under an imperfect channel estimation, a Device-to-Device (D2D) communication framework based on MIMO relay technology is presented. The model consists of a D2D pair equipped with M antennas and a relay equipped with N antennas as well as a cellular user equipped with M antennas. The outage probability under different relaying protocols (i.e. AF and DF protocol) with and without considering a direct link was derived. The actual and theoretical outage probability of the five links under different antenna numbers was emulated. The number of user antennas and channel estimation error was analyzed carefully to determine their impact on the outage probability of a system. The simulation verified the theory analyses and the results showed that MIMO relaying improves the D2D communication system performance.

• ETRI Journal
• /
• 제36권4호
• /
• pp.609-616
• /
• 2014

Even though many computational methods (recursive formulae) for blocking probabilities in finite-capacity M/D/1 queues have already been produced, these are forms of transforms or are limited to single-node queues. Using a distinctly different approach from the usual queueing theory, this study introduces explicit (transform-free) formulae for a blocking probability, a stationary probability, and mean sojourn time under either production or communication blocking policy. Additionally, the smallest buffer capacity subject to a given blocking probability can be determined numerically from these formulae. With proper selection of the overall offered load ${\rho}$, the approach described herein can be applicable to more general queues from a computational point of view if the explicit expressions of random vector $D_n$ are available.