• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.87-95
• /
• 1991

The exact solution of the closed queueing networks(CQN) is known only for the product form (BCMP) queueing networks. Various computational algorithms are available to derive system throughput(the rate at which a system completes units of computational work) of the networks. However, the computational expense of an exact solution is often excessive when there are multiple classes of cutomers. Instead of computing the exact values, it may be sufficient to derive bounds on the performance measures. Techniques for obtaining bounds on BCMP queueing networks have appeared in the past years. This paper also presents bounds on throughput in CQN models with multiple classes of customers.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.10
• /
• pp.2060-2066
• /
• 2002

The closed-loop state and input observer is a pole-placement type observer and estimates unknown state and input variables simultaneously. Pole-placement type observers may have poor transient performance with respect to ill-conditioning factors such as unknown initial estimates, round-off error, etc. For the robust transient performance, the effects of these ill-conditioning factors must be minimized in designing observers. In this paper, the transient performance of the closed-loop state and input observer is investigated quantitatively by considering the error bounds due to ill-conditioning factors. The performance indices are selected from these error bounds and are related to the observer robustness with respect to the ill -conditioning factors. The closed-loop state and input observer with small performance indices is considered as a well-conditioned observer from the transient perspective.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.10
• /
• pp.2067-2072
• /
• 2002

The closed-loop state and input observer is a pole-placement type observer and estimates unknown state and input variables simultaneously. Pole-placement type observers may have poor performances with respect to modeling error and sensing bias error. The effects of these ill-conditioning factors must be minimized for the robust performance in designing observers. In this paper, the steady-state performance of the closed-loop state and input observer is investigated quantitatively and is represented as the estimation error bounds. The performance indices are selected from these error bounds and are related to the robustness with respect to modeling errors and sensing bias. By considering both transient and steady-state performance, the main performance index is determined as the condition number of the eigenvector matrix based on $L_2$-norm.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.10
• /
• pp.1100-1108
• /
• 1992

The evaluation of coded error probabilities for antijam communication systems is usually difficult to do and, thus, easy-to-evaluate upper bounds are used. Since it is relatively easy to evaluate the cutoff rate for the coding channel, the coded bit error bounds for most antijam systems of interest can be easily expressed directly in terms of this cutoff rate parameter using the relationship between the bit error bounds and cutoff rate for AWGN channel. The key feature of these bounds is the decoupling of the coding aspects of the system from the remaining part of the communication system which includes jamming, suboptimum detectors, and arbitrary decoding metrics which may or may not use jammer state knowledge. In this paper the bit error bounds for the Trumpis coded FH/MFSK with an AWGN channel are translated into the corresponding bit error bounds for boradband and partial band noise jammer. And the impact of the side information about jammer state is also evaluated with these upper bounds. Although it is considered for the soft decision detector, it is also applicable to the hard decision detector.

• International Journal of Reliability and Applications
• /
• v.3 no.3
• /
• pp.133-145
• /
• 2002

The traditional methods of evaluating the performance of a network by enumerating all possible states may quickly become computationally prohibitive, since the number of states grows exponentially as the number of components increases. In such cases, enumerating only the most probable states would provide a good approximation. In this paper, we propose a method which efficiently generates upper and lower bounds for coherent performance measures utilizing the most probable states. Compared with Yang and Kubat's method, our procedure significantly reduces the complexity and memory requirement per iteration for computing the bounds and thereby, achieves the given degree of accuracy or the coverage within a shorter time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.907-910
• /
• 2010

This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree $d_{{\upsilon},max}$. To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths ($5{\times}10^2\;{\leq}\;N\;{\leq}\;4{\times}10^3$). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree $d_{{\upsilon},max}$. We also present some simulation results which show how a block length can be optimized.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1492-1495
• /
• 1996

In this paper, an approach to autopilot design based on the robust nonlinear dynamic inversion method is proposed. Both unknown parameters and uncertainty bounds are estimated and parameter estimates are used in the fast inversion. Furthermore, to get more robustness slow inversion is incorporated with MRAC(Model Reference Adaptive Control) and sliding mode control where the estimates of uncertainty bounds are used. The proposed method is applied to the pitch autopilot design of a missile system and excellent performance is shown via computer simulation.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.9
• /
• pp.77-83
• /
• 2003

In this paper, a robust controller is proposed to control a robot manipulator which is governed by highly nonlinear dynamic equations. The controller is computationally efficient since it does not require the dynamic model or parameter values of a robot manipulator. It, however, requires uncertainty bounds which are derived by using properties of revolute joint robot dynamics. The stability of the robot with the controller is proved by Lyapunov theory. The results of computer simulations show that the robot system is stable, and has excellent trajectory tracking performance.