• Communications of the Korean Mathematical Society
• /
• v.17 no.4
• /
• pp.741-754
• /
• 2002

In this paper we present an error bound for cubic spline approximation of conic section curve. We compare it to the error bound proposed by Floater [1]. The error estimating function proposed in this paper is sharper than Floater's at the mid-point of parameter, which means the overall error bound is sharper than Floater's if the estimating function has the maximum at the midpoint.

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

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.10 s.340
• /
• pp.29-34
• /
• 2005

The maximum quantization error has serious effect on the performance of fixed-width multipliers that receive W-bit inputs and produce W-bit products. In this paper, we analyze the error bound of fixed-width modified Booth multipliers. Then, the estimation method for the number of additional columns for fixed-width multipliers is proposed to limit the maximum quantization error within a desired bound. In addition, it is shown that our methodology can be extended to reduced-width multipliers. By simulations, it is shown that the proposed error analysis method is useful to the practical design of fixed-width modified Booth multipliers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.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.

• Nuclear Engineering and Technology
• /
• v.54 no.4
• /
• pp.1195-1205
• /
• 2022

Recent developments on spectral diffusion algorithms, i.e., algorithms which exploit the projection of the solution on the eigenfunctions of the Laplacian operator, demonstrated their effective applicability in fast transient conditions. Nevertheless, the numerical error introduced by these algorithms, together with the uncertainties associated with model parameters, may impact the reliability of the predictions on short-lived volatile fission product release from nuclear fuel. In this work, we provide an upper bound on the numerical error introduced by the presented spectral diffusion algorithm, in both constant and time-varying conditions, depending on the number of modes and on the time discretization. The definition of this upper bound allows introducing a methodology to a priori bound the numerical error on short-lived volatile fission product retention.

• Asia pacific journal of information systems
• /
• v.3 no.1
• /
• pp.155-189
• /
• 1993

Empirical studies have shown that the performance of decision tree induction usually improves when the trees are pruned. Whether these results hold in general and to what extent pruning improves the accuracy of a concept have not been investigated theoretically. This paper provides a theoretical study of pruning. We focus on a particular type of pruning and determine a bound on the error due to pruning. This is combined with PAC (Probably Approximately Correct) Learning theory to determine a sample size sufficient to guarantee a probabilistic bound on the concept error. We also discuss additional pruning rules and give an analysis for the pruning error.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.960-967
• /
• 2008

This paper shows that design of a robustly stable repetitive control system is equivalent to that of a feedback control system for an uncertain linear time-invariant system satisfying the well-known robust performance condition. Once a feedback controller is designed to satisfy the robust performance condition, the feedback controller and the repetitive controller using the performance weighting function robustly stabilizes the repetitive control system. It is also shown that we can obtain a steady-state tracking error described in a simple form without time-delay element if the robust stability condition is satisfied for the repetitive control system. Moreover, using this result, a sufficient condition is provided, which ensures that the least upper bound of the steady-state tracking error generated by the repetitive control system is less than or equal to the least upper bound of the steady-state tracking error only by the feedback system.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.11
• /
• pp.2688-2695
• /
• 2000

In multi-axis force sensor, compliance matrices representing structural behaviour of internal sensor bodies play an important role in decoupled sensing and accuracy, Recently, error propagation through compliance matrices has been studied via approximation approach. However the upper bound of measured force error has not been known. In this paper, error propagation in force sensing is analysed in a unified way when both strain measurement error and compliance matrix error exist, and the upper bound of the measured force error is derived exactly(not approximately). The analysis is examined through a numerical example.

• Journal of Satellite, Information and Communications
• /
• v.7 no.1
• /
• pp.53-58
• /
• 2012

In this paper, we evaluate and analyze representative estimation methods for the sparse channel. In order to evaluate error performance of matching pursuit(MP) and minimum mean square error(MMSE) algorithm, lower bound of MMSE is determined by Cramer-Rao bound and compared with upper bound of MP. Based on analysis of those bounds, mean square error of MP which is effective in the estimation of sparse channel can be larger than that of MMSE according to the number of estimated tap and signal-to-noise ratio. Simulation results show that the performances of both algorithm are reversed on the sparse channel with Rayleigh fading according to signal-to-noise ratio.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.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.