• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.138-143
• /
• 2006

We present upper bounds for the maximum-likelihood decoding performance of particular LDPC codes and turbo-like codes with particular interleavers. Previous research developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption, which bound the performance averaged over all ensemble codes or all interleavers. Proposed upper bounds are based on the simple bound and estimated weight distributions including the exact several smallest distance terms because if either estimated weight distributions on their own or the exact several smallest distance terms only are used, an accurate bound can not be obtained.

• 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 the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.1-10
• /
• 1995

The purpose of this paper is to develop a method of the sensitivity analysis that can be applied to a non-tree solution of the minimum cost flow problem. First, we introduce two types of sensitivity analysis. A sensitivity analysis of Type 1a is the well known method applicable to a tree solution. However this method can not be applied to a non-tree solution. So we propose a sensitivity analysis of Type 2 that keeps solutions of upper bounds at upper bounds, those of lower bounds at lower bounds, and those of intermediate values at intermediate values. For the cost coefficient we present a method that the sensitivity analysis of Type 2 is solved by finding the shortest path. Besides we also show that the results of Type 2 and Type 1 are the same in a spanning tree solution. For the right-hand side constant or the capacity, the sensitivity analysis of Type 2 is solved by a simple calculation using arcs with intermediate values.

• IE interfaces
• /
• v.7 no.3
• /
• pp.193-199
• /
• 1994

The purpose of this paper is to develop a method of the sensitivity analysis that can be applicable to a degenerate tree solution of the minimum cost flow problem. First, we introduce two types of sensitivity analysis. A sensitivity analysis of Type 1 is the well known method applicable to a spanning tree solution. However, this method have some difficulties in case of being applied to a degenerate tree solution. So we propose a sensitivity analysis of Type 2 that keeps solutions of upper bounds remaining at upper bounds, those of lower bounds at lower bounds, and those of intermediate values at intermediate values. For the cost coefficient, we present a method that the sensitivity analysis of Type 2 is solved by using the method of a sensitivity analysis of Type 1. Besides we also show that the results of sensitivity analysis of Type 2 are union set of those of Type 1 sensitivity analysis. For the right-hand side constant or the capacity, we present a simple method for the sensitivity analysis of Type 2 which uses arcs with intermediate values.

• Journal of applied mathematics & informatics
• /
• v.34 no.3_4
• /
• pp.319-330
• /
• 2016

The hyper-Zagreb index HM(G) of a simple graph G is defined as the sum of the terms (d_u+d_v)² over all edges uv of G, where d_u denotes the degree of the vertex u of G. In this paper, we present several upper and lower bounds on the hyper-Zagreb index in terms of some molecular structural parameters and relate this index to various well-known molecular descriptors.

• 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.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.57-61
• /
• 1989

An adaptive control scheme is presented for uncertain systems whose uncertaintiy bounds are expressed as a linear combination of unknown functions of special form. Both the states and the parameter estimate errors of the closed-loop system are proven to be bounded. The regulation errors can be made sufficiently small by adjusting the design parameters. An application of the proposed method to the position control of a simple pendulum is given.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.157-169
• /
• 2006

We study properties concerning approximation of fuzzy-number-valued functions by fuzzy B-spline series. Error bounds in approximation by fuzzy B-spine series are obtained in terms of the modulus of continuity. Particularly simple error bounds are obtained for fuzzy splines of Schoenberg type. We compare fuzzy B-spline series with existing fuzzy concepts of splines.

• Journal of the Korean Statistical Society
• /
• v.24 no.2
• /
• pp.507-518
• /
• 1995

The ordinary least squares based estiamte $S^2$ of the disturbance variance is considered in the linear regression model when the disturbances follow the first-order moving-average process. It is shown that $S^2$ is weakly consistent estimate for the disturbance varaince without any restriction on the regressor matrix X. Also, simple exact bounds on the relative bias of $S^2$ are given in finite sample sizes.

• Korean Journal of Mathematics
• /
• v.28 no.4
• /
• pp.943-953
• /
• 2020

A university grades input system requires for professors to enter the normalized total scores for the letter grades and to input the scores from six fields such as Midterm, Final, Quiz which sum up to the total. All six fields have specified bounds which add up to 100. Professors should scale in the total scores to match up the letter grades and scale in every field of each student's original scores within the bounds to sum up to the scaled total score. We solve this problem by a novel design of simple shallow neural network.