• Journal of the Korean Statistical Society
• /
• 제21권1호
• /
• pp.27-34
• /
• 1992

This paper provides a method of obtaining a lower bound on the probability of correct selection for a two-stage selection procedure. The resulting lower bound sharpens that by Tamhane and Bechhofer (1979) for the normal means problem with a common known variance. The design constants associated with the lower bound are computed and the results of the performance comparisons are given.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1546-1553
• /
• 1996

The bit error probability of RS/trellis concatenated coded-modualtion system in the mobile radio channel is analyzed. A new upper bound to the symbol error probability of the inner TCM in the mobile radio channel is obtained by exploiting the unequal symbol error probability of the TCM. This bound is applied to the derivation of the upper bound to the bit error probability of the concatenated coded-modulation system. An efficient way of searching distance spectrum of the TCM in mobile radio channel is devised. Our new bounds are tighter than the earlier studied other bounds.

• 전자공학회논문지A
• /
• 제30A권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.

• Journal of the Korean Statistical Society
• /
• 제18권1호
• /
• pp.26-37
• /
• 1989

When we select the t best out of k populations in the indifference zone formulation, a lower confidence bound on the probability of a correct selection is derived for families with monotone likelihood ratio. The result is applied to the normal means problem when the variance is common, and to the normal variances problem. Tables to implement the confidence bound for the normal variances problem are provided.

• 전자공학회논문지A
• /
• 제31A권9호
• /
• pp.34-43
• /
• 1994

The unequal symbol error probability of TCM(trellis coded modulation) is analyzed and applied to the derivation of bit error probability of /RS/Trellis concatenated coded-modulation system. An upper bound of the symbol error probability of TCM concatenated with RS code is obtained by exploiting the unequal symbol error probability of TCM, and it is applied to the derivation of the upper bound of the bit error probability of the RS/Trellis concatenated coded-modulation system. Our upper bounds of the concatenated codes are tighter than the earlier established other upper bounds.

• Nuclear Engineering and Technology
• /
• 제54권8호
• /
• pp.2915-2923
• /
• 2022

There is an increasing interest in passive safety systems to minimize the need for operator intervention or external power sources in nuclear power plants. Because a passive system has a weak driving force, there is greater uncertainty in the performance compared with an active system. In previous studies, several methods have been suggested to evaluate passive system reliability, and many of them estimated the failure probability using thermal-hydraulic analyses and the Monte Carlo method. However, if the functional failure of a passive system is rare, it is difficult to estimate the failure probability using conventional methods owing to their high computational time. In this paper, a procedure for the application of the Chernoff bound to the evaluation of passive system reliability is proposed. A feasibility study of the procedure was conducted on a passive decay heat removal system of a micro modular reactor in its conceptual design phase, and it was demonstrated that the passive system reliability can be evaluated without performing a large number of thermal-hydraulic analyses or Monte Carlo simulations when the system has a small failure probability. Accordingly, the advantages and constraints of applying the Chernoff bound for passive system reliability evaluation are discussed in this paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권6호
• /
• pp.1606-1626
• /
• 2012

This paper investigates the performance of an amplify-and-forward (AF) two-way relaying system with antenna correlation. The system consists of two multiple-antenna sources, which exchange information via the aid of a single-antenna relay. In particular, we derive the exact outage probability expression. Furthermore, we provide a simple, tight closed-form lower bound for the outage probability. Based on the lower bound, we obtain the closed-form asymptotic outage probability and the average symbol error rate expressions at high signal-to-noise ratio (SNR), which reveal the system's diversity order and coding gain with antenna correlation. To investigate the system's throughput performance with antenna correlation, we also derive a closed-form lower bound for the average sum-rate, which is quite tight from medium to high SNR regime. The analytical results readily enable us to obtain insight into the effect of antenna correlation on the system's performance. Extensive Monte Carlo simulations are conducted to verify the analytical results.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.543-546
• /
• 1996

Recently, some research has been done to analyze the asymptotic behavior of queue length distribution in ATM (Asynchronous Transfer Mode) multiplexer. In this paper, we relate this asymptotic behavior with the asymptotic behavior of decreasing cell loss probability when the buffer capacity is increased. We find with reasonable assumptions that the asymptotic rate of queue length distribution is the same as that of decreasing cell loss probability. Even under different priority control schemes and traffic classes, we find that this asymptotic rate of the individual cell loss probability of each traffic class does not change. As a consequence, we propose the upper bound of cell loss probability of each traffic class when a priority control scheme is employed. This bound is computationally feasible in a real-time. The numerical examples will be provided to validate this finding.

• 정보보호학회논문지
• /
• 제29권6호
• /
• pp.1259-1270
• /
• 2019

블록 암호를 설계할 때, 설계자는 주로 차분 특성 확률의 상한을 이용하여 라운드 수를 결정한다. 라운드 수는 블록 암호의 성능에 영향을 미치므로, 더 적은 라운드를 갖기 위해 차분 특성 확률의 상한을 정밀하게 계산하는 것이 중요하다. 이전까지의 활성 S-box의 최소 개수를 탐색하는 방법들은 비선형 연산과 선형 연산을 각각 제약식으로 구성하여 차분 특성 확률의 상한을 계산하였다. 하지만 선형 연산이 비선형 연산에 의존적으로 선택되는 BOGI 설계전략(Bad-Output Good-Input Design Strategy)의 경우 이전 탐색방법으로 구한 상한은 정밀하지 않을 수 있다. 본 논문에서는 BOGI 전략의 성질을 이용하여 기존의 방법보다 더 정밀한 차분 특성 확률의 상한을 구하는 새로운 방법을 제안한다. 그리고 이 방법을 이용하여 구한 상한의 타당성을 수학적으로 증명한다. 제안한 방법을 BOGI가 사용된 GIFT-64와 GIFT-128에 각각 적용하여 9라운드까지 차분 특성 확률의 상한을 탐색하였다. GIFT-64의 7라운드와 GIFT-128의 9라운드에 대해 기존의 방법을 적용하면 차분 특성 확률의 상한이 각각 2^-18.395와 2^-26.885이었으나, 제안한 방법을 적용하면 각각 2^-19.81과 2^-28.3으로 더 정밀하게 계산된다.

• 한국전자파학회논문지
• /
• 제11권3호
• /
• pp.352-357
• /
• 2000

이 논문에서는 동기 MPSK 신호에 대하여 새로운 간단한 심볼 오류 확률 하한식을 유도하고 분석한다. 보통 심볼 오류 확률 유도는 먼저 덧셉꼴 백색 정규잡음(AWGN) 환경에서 유도하고 이에 대한 결과를 바탕으로 여러 페이딩 환경에서의 심볼 오류 확률을 구하는 것이 일반적인 방법이다. 그러나 동기 MPSK의 경우는 여러 페 이딩 환경에서의 오류 확률 식이 구해져 있으나 가장 기본이 되는 덧셈팔 백색 정규 잡음 환경에서는 정확히 closed-form으로 유도하지 못하는 것으로 알려져 있다. 여기서는 먼저 나카가미 페이딩 환경에서 동기 MPSK 신호의 심볼 오류 확률식을 이용하여 나카가미 페이딩 지수가 무한대로 감에 따라 페이딩이 없는 덧셈꼴 백색 정규 잡음 채널로 돌아가는 성질을 이용하여 새로운 근사식을 유도하고 분석한다.