• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.64-69
• /
• 1993

In this paper we present the performance bounds of the optimal FIR filter in continuous time systems with modeling uncertainty. The performance measure bounds are calculated from the estimation error covariance bounds of the optimal FIR filter and the suboptimal FIR filter. Performance error bounds range are expressed by the upper bounds on the estimation error covariance difference between the real and nominal values in case of the systems with noise uncertainty or model uncertainty. The performance bounds of the systems are derived on the assumption that the system uncertainty and the estimation error covariance are imperfectly known a priori. The estimation error bounds of the optimal FIR filter is compared with those of the Kalman filter via a numerical example applied to the estimation of the motion of an aircraft carrier at sea, which shows the former has better performances than the latter.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.594-597
• /
• 2010

This paper estimates belief-propagation (BP) decoding performance of moderate-length irregular low-density parity-check (LDPC) codes with sphere bounds. We note that for moderate-length($10^3{\leq}N{\leq}4\times10^3$) irregular LDPC codes, BP decoding performance, which is much worse than maximum likelihood (ML) decoding performance, is well matched with one of loose upper bounds, i.e., sphere bounds. We introduce the sphere bounding technique for particular codes, not average bounds. The sphere bounding estimation technique is validated by simulation results. It is also shown that sphere bounds and BP decoding performance of irregular LDPC codes are very close at bit-error-rates (BERs) $P_b$ of practical importance($10^{-5}{\leq}P_b{\leq}10^{-4}$).

• Journal of Institute of Control, Robotics and Systems
• /
• v.1 no.1
• /
• pp.20-24
• /
• 1995

In this paper we analyze the performance bounds of the optimal FIR filter in continuous time systems with modeling uncertainty. The performance bounds are presented by the estimation error convariance and they are here expressed by the upper bounds of the difference of the estimation error covariance between the real and nominal values in case of the system with model uncertainties whose upper bounds are imperfrctly known a priori. The performance bounds of the optimal FIR filter are compared with those of the Kalman filter via a numerical example applied to the estimation of the motion of an aircraft carrier at sea, which shows the former has better performances than the latter.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.52-54
• /
• 1991

In this paper, the robust stability, and the quadratic performance of linear uncertain systems are studied. A quadratic Lyapunov function candidate with time-varying matrix is derived to provide robust stability bounds. Also upper bounds of a quadratic performance is given under the assumption that the uncertain system is stable. Both the robust stability bounds and the upper bounds of a quadratic performance are obtained as solutions of a class of modified Lyapunov equations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.880-882
• /
• 2008

This paper presents LDPC codes' upper bounds over the waterfall SNR region. The previous researches have focused on the average bound or ensemble bound over the whole SNR region and showed the performance differences for the fixed block size. In this paper, the particular LDPC codes' upper bounds for various block sizes are calculated over the waterfall SNR region and are compared with BP decoding performance. For different block sizes the performance degradation of BP decoding is shown.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11C
• /
• pp.1025-1028
• /
• 2009

This paper presents upper bounds of Maximum Likelihood (ML) decoding performance of a few irregular LDPC codes using the simple bound and ML input output weight distributions and it is shown that contrary to general opinion that as block length becomes longer, BP decoding performance becomes simply closer to ML decoding performance, before peak degradation, as block length becomes longer, BP decoding performance falls behind ML decoding performance more and after peak degradation, general opinion holds.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.352-355
• /
• 1995

In this paper, estimation error bounds of the optimal FIR (Finite Impulse Response) filter, which is proposed by Kwon et al.[1, 2], are presented in discrete-time systems with the model uncertainty. Performance bounds are here represented by the upper bounds on the difference of the estimation error covariances between the nominal and real values in case of the systems with the noise or model parameter uncertainty. The estimation error bounds of the discrete-time optimal FIR filter is compared with those of the Kalman filter via a numerical example applied to the simulation problem by Toda and Patel[3]. Simulation results show that the former has robuster performance than the latter.

• 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 Statistical Society
• /
• v.35 no.3
• /
• pp.281-303
• /
• 2006

In an earlier work, we investigated the problem of using linear programming to bound performance measures in a discrete time Jackson network. There it was assumed that the system evolution is controlled by the early arrival scheme. This assumption implies that the system can't be modelled by a Markov chain. This problem was resolved and performance bounds were calculated. In the present work, we use a modification of the early arrival scheme (without corrupting it) in order to make the system evolves as a Markov chain. This modification enables us to obtain explicit expressions for certain moments that could not be calculated explicitly in the pure early arrival scheme setting. Moreover, this feature implies a reduction in the linear program size as well as the computation time. In addition, we obtained tighter bounds than those appeared before due to the new setting.

• Journal of the Korean Statistical Society
• /
• v.32 no.4
• /
• pp.359-371
• /
• 2003

We consider the probability that the total population of a stable Jackson network reaches a given large value. By using the fluid limit of the reversed network, we derive new upper and lower bounds on this probability, which are sharper than those in Glasserman and Kou (1995). In particular, the improved lower bound is useful for analyzing the performance of an importance sampling estimator for the overflow probability in Jackson tandem networks. Bounds on the expected time to overflow are also obtained.