• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2B
• /
• pp.87-96
• /
• 2012

In this paper, we consider a 2-hop relay system where both the relay and destination nodes suffer from the arbitrary number of co-channel interferers. More specifically, assuming that the relay and access channels as well as interference channels are all subject to Rayleigh fading, we derive an exact closed-form expression for outage probability of the amplify-and-forward (AF) relay system, and furthermore compute its upper and lower bounds. Based on these bounds, we derive the upper and lower bounds on the average bit error rate (BER) of the AF relay system. We also confirm the accuracy of our derivation by investigating the performance gap between the performance bounds under consideration and simulation results.

• Journal of the Korean Data and Information Science Society
• /
• v.11 no.1
• /
• pp.31-35
• /
• 2000

We shall give upper and lower bounds of the odds ratio of an event by a slight condition of the conditional probability of events.

• Communications of the Korean Mathematical Society
• /
• v.12 no.3
• /
• pp.725-741
• /
• 1997

This paper considers the problem of deriving exponential probability inequalities for product symmetric Poisson processes. As an application they are used to show the existence of regular version of some product process derived from L$\acute{e}$vy process.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.11 no.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 Korea Society of Industrial Information Systems
• /
• v.12 no.1
• /
• pp.80-86
• /
• 2007

The concept of the coverage has been played an important role in the area of reliability evaluation of a system. The widely used measures of reliability include the m time between failures, the availability and so on. In this paper, we propose an estimator of the coverage probability in a redundant system with a control unit and investigate some moments of the proposed estimator. And assuming exponential distribution of all units, we conduct a simulation study for calculating the estimates of the coverage probability and its confidence bounds. An example of evaluating the availability of an optical transportation system is illustrated.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.8
• /
• pp.19-26
• /
• 1993

The bit error probability of Reed-Solomon/convolutional concatenated codes can be more exactly calculated by using a more approximate bound of the symbol error probability of the convolutional codes. This paper obtains the unequal symbol error bound of the convolutional codes, and applies to the calculation of the bit error probability of the concatenated codes. Our results are tighter than the earlier studied other bounds.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.209-225
• /
• 1998

In this paper we obtain sharp upper and lower bounds of small ball oprobabilities for Gaussian processes with stationary increments, whose results are essential to estabilish Chung type laws of iterated logarithm.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.2
• /
• pp.327-335
• /
• 2004

In this paper, we reformulate a snapshot attractor([5]), ($K,\;\={\mu_{\iota}}$) generated by a random baker's map with a sequence of probability measures {\={\mu_{\iota}}} on K. We obtain bounds of the correlation dimensions of ($K,\;\={\mu_{\iota}}$) for all ${\iota}\;{\geq}\;1$.

• Journal of the Korean Statistical Society
• /
• v.25 no.4
• /
• pp.489-497
• /
• 1996

Lower bounds for the full level probabilities are derived under order restrictions in weights. Discussions are made on typical isotonic cones such as linear order, simple tree order, and unimodal order cones. We also discuss applications of these results for constructing conditional likelihood ratio tests for ordered hypotheses in a contingency table. A real data set on torus mandibularis will be analyzed for illustrating the testing procedure.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.2
• /
• pp.171-175
• /
• 2009

Let $A_1,\;A_2,\;{\cdots},\;A_n$ be a sequence of events on a given probability space. Let $m_n$ be the number of those $A_{i}{^{\prime}}s$ which occur. We establish an improved lower bounds of Univariate Bonferroni-Type inequality by using the linearity of binomial moments $S_1,\;S_2,\;S_3,\;S_4$ and$S_5$.