• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.4
• /
• pp.257-265
• /
• 2009

In this paper we find an explicit form of upper bound of Hausdorff distance between given cubic spline curve and its quadratic spline approximation. As an application the approximation of offset curve of cubic spline curve is presented using our explicit error analysis. The offset curve of quadratic spline curve is exact rational spline curve of degree six, which is also an approximation of the offset curve of cubic spline curve.

• Communications of the Korean Mathematical Society
• /
• v.20 no.4
• /
• pp.861-873
• /
• 2005

In this paper we approximate a cylindrical helix by bi-conic and bi-quadratic Bezier curves. Each approximation method is $G^1$ end-points interpolation of the helix. We present a sharp upper bound of the Hausdorff distance between the helix and each approximation curve. We also show that the error bound has the approximation order three and monotone increases as the length of the helix increases. As an illustration we give some numerical examples.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.1-10
• /
• 1997

In this paper, an improved lower bound on the burst-error correcting capability of th ecyclic product code is presented and through the analysis of this new bound clustered cyclic product (CCP abbr.)code is proposed. The CCP code, to improve the burst-error correcting capability, combines the idea of clustering and the transmission method of cyclic product code. That is, a cluster which is defined in this paper as a group of consecutive code symbols is employed as a new transmission unit to the code array transmission of cyclic product code. the burst-error correcting capability of the CCP code is improved without a loss in the random-error correcting capability and performance comparison in the digital video camera records (DVCR) system shows the superiority of the proposed CCP code over conventional product codes.

• Honam Mathematical Journal
• /
• v.30 no.3
• /
• pp.581-587
• /
• 2008

In this paper, to have a better a posteriori error bound of the average case error between the true value of I(f) and the Trapezoidal rule on subintervals using zero mean-Gaussian, we prove that a new average error between the difference of the true value of I(f) from the composite Trapezoidal rule and that of the composite Trapezoidal rule from the simple Trapezoidal rule is bounded by $c_rH^{2r+3}$ through direct computation of constants $c_r$ for r ${\leq}$ 2 under the assumption that we have subintervals (for simplicity equal length h) partitioning [0, 1].

• Ocean and Polar Research
• /
• v.30 no.2
• /
• pp.149-158
• /
• 2008

The characteristic analysis of the estimated population parameters, i.e., standard deviation and error bound of coastal pollutant concentrations (hereafter PC, i.e., COD, TN, and TP concentrations), was carried out by using environmental data with different sampling frequency in Lake Shihwa and Incheon coastal zone. The results clearly show that standard deviation of the PC increases as its mean value increases. The error bounds of the annual mean values based on seasonally measured DO concentrations and PC data in Incheon coastal zone were estimated as ranges 2.26 mg/l, $0.68{\sim}0.86\;mg/l$, $0.62{\sim}0.80\;mg/l$, and $0.074{\sim}0.082\;mg/l$, respectively. In terms of annual mean of the DO concentration and PC in Lake Shihwa, the error bounds based on monthly measured data from 1997 to 2003 were also estimated as ranges 4.0 mg/l, 3.0 mg/l, $0.5{\sim}1.0\;mg/l$, and 0.05 mg/l, respectively. The error bound on the basis of real-time monitoring data is $7{\sim}13%$ only as compared to that of monthly measured data.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.125-129
• /
• 1987

The stability margin of the LQ regulator is investigated in the time domain. it is shown that the same guaranteed gain margin as that of the frequency domain analysis can be obtained with simple assumptions for the continuous time systems. It is also shown that the allowable modelling error bound can be expressed in terms of system matrices and Riccati equation solution. Guaranteed qain. margin and the allowable modelling error bound for the discrete time systems are also obtained by the similar procedures. In this case, through the some examples, the gain margin is shown to be less conservative than the frequency domain analysis result.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.3
• /
• pp.268-275
• /
• 2003

In this paper, the capacity of VSG-CDMA system supporting multi-media service in the reverse link is analyzed by considering the two models according to the power control and user distribution. In analysis model I, assuming perfect power control and uniform distribution of users, the equation of blocking probability is calculated and the maximum number of voice and data user is derived in accordance with 1 % blocking probability. In analysis model II, it is analyzed by assuming power control error and non-uniform distribution of users. The result of analysis model I means the upper bound of system capacity in the 5 MHz wideband VSG-CDMA system, and the result of analysis model II shows the lower bound of system capacity. Also, the improved plan of performance for VSG-CDMA system is suggested by the analyzed result according to data activity and the value of $E_b/N_o$ in model II.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.3
• /
• pp.218-227
• /
• 2017

In this paper, an algorithm to calculate both bearing and distance error for target detection and localization is proposed using the Cramer Rao lower bound to estimate the minium variance of their error in DOA (Direction Of Arrival) estimation. The performance of arrays in detection and localization depends on the accuracy of DOA, which is affected by a variation of SNR (Signal to Noise Ratio). The SNR is determined by sonar parameters such as a SL (Source Level), TL (Transmission Loss), NL (Noise Level), array shape and beam steering angle. For verification of the suggested method, a Monte Carlo simulation was performed to probabilistically calculate the bearing and distance error according to the SNR which varies with the relative position of the target in space and noise level.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.282-291
• /
• 2008

This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

• Journal of electromagnetic engineering and science
• /
• v.11 no.2
• /
• pp.133-142
• /
• 2011

Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.