• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• 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.

• 한국통신학회논문지
• /
• 제35권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}$).

• 제어로봇시스템학회논문지
• /
• 제1권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년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• 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.

• 한국통신학회논문지
• /
• 제33권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.

• 한국통신학회논문지
• /
• 제34권11C호
• /
• pp.1025-1028
• /
• 2009

본 논문에서는 기존의 단순 한계와 Maximum Likelihood (ML) 추정 입력 출력 무게 분포를 사용하여 몇 개의 불규칙한 LDPC 부호의 ML 복호에 대한 성능의 상향 한계를 구하고 부호의 길이가 길어지면 Belief-Propagation (BP) 복호의 성능이 ML 복호 성능에 단순하게 근접해 간다는 일반적인 견해와는 상반되게 정점 성능 감쇠(Peak Degradation)에 다다르기 이전에는 부호의 길이가 길어지면 오히려 BP 복호의 성능이 ML 복호 성능으로부터 성능 감쇠 폭이 증가하고 정점 성능 감쇠를 지난 후에 일반적인 견해가 적용되는 것을 보인다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• 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.

• 한국통신학회논문지
• /
• 제37권2B호
• /
• pp.87-96
• /
• 2012

본 논문에서는 2-홉 릴레이 시스템에서 릴레이 노드와 목적지 노드가 모두 임의의 수를 갖는 간섭원들의 영향을 받는 상황을 고려한다. 특히 릴레이 채널과 액세스 채널, 그리고 간섭 채널들이 모두 레일리 페이딩을 겪는다고 가정할 때, 증폭-후-전달(amplify-and-forward: AF) 릴레이 시스템의 불능 확률에 대한 정확한 수식을 도출하고, 나아가 불능 확률의 상한 식(upper bound)과 하한 식(lower bound)을 도출한다. 또한 도출된 불능 확률의 상한 식과 하한 식을 이용하여 AF 릴레이 시스템의 비트 오류율 성능에 대한 상한 식과 하한 식을 도출한다. 그리고 도출된 AF 릴레이 시스템의 불능 확률과 비트 오류율 성능에 대한 상한 식과 하한 식의 정확도를 모의실험을 통해 확인한다.

• Journal of the Korean Statistical Society
• /
• 제35권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
• /
• 제32권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.