• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.288-294
• /
• 2008

Motivated by the fact that upper solution bounds for the continuous Lyapunov equation are valid under some very restrictive conditions, an attempt is made to extend the set of Hurwitz matrices for which such bounds are applicable. It is shown that the matrix set for which solution bounds are available is only a subset of another stable matrices set. This helps to loosen the validity restriction. The new bounds are illustrated by examples.

• 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}$).

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.5
• /
• pp.432-435
• /
• 2020

The elasticity tensor for water may be employed to model the fully saturated porous material. Mostly water is assumed to be incompressible with a bulk modulus, however, the upper and lower bounds of off-diagonal components of the elasticity tensor of porous materials filled with water are violated when the bulk modulus is relatively high. In many cases, the generalized Hill inequality describes the general bounds of Voigt and Reuss for eigenvalues, but the bounds for the component of elasticity tensor are more realistic because the principal axis of eigenvalues of two phases, matrix and water, are not coincident. Thus in this paper, for anisotropic material containing pores filled with water, the bounds for the component of elasticity tensor are expressed by the rule of mixture and the upper and lower bounds of fully saturated porous materials are violated for low porosity and high bulk modulus of water.

• 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 Korea Institute of Information, Electronics, and Communication Technology
• /
• v.5 no.1
• /
• pp.52-59
• /
• 2012

The bone material is a composite material consisted of collagen and mineral crystals. Also it shows transversely isotropic symmetry. So far none has shown that the components of the elasticity tensor satisfy the Voigt and Reuss bounds. To determine the effective elastic constant of bone material, the Voigt and Reuss bounds are employed and we show that the components of the elasticity tensor satisfy the Voigt and Reuss bounds. Mathematically this bounds are satisfied on two conditions only out of four conditions.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.182-189
• /
• 2016

The focus in this paper is on obtaining tight, simple algebraic-form bounds and invertible expressions for the average symbol error probability (ASEP) of M-ary phase shift keying (MPSK) in a class of composite fading channels. We employ the mixture gamma (MG) distribution to approximate the signal-to-noise ratio (SNR) distributions of fading models, which include Nakagami-m, Generalized-K ($K_G$), and Nakagami-lognormal fading as specific examples. Our approach involves using the tight upper and lower bounds that we recently derived on the Gaussian Q-function, which can easily be averaged over the general MG distribution. First, algebraic-form upper bounds are derived on the ASEP of MPSK for M > 2, based on the union upper bound on the symbol error probability (SEP) of MPSK in additive white Gaussian noise (AWGN) given by a single Gaussian Q-function. By comparison with the exact ASEP results obtained by numerical integration, we show that these upper bounds are extremely tight for all SNR values of practical interest. These bounds can be employed as accurate approximations that are invertible for high SNR. For the special case of binary phase shift keying (BPSK) (M = 2), where the exact SEP in the AWGN channel is given as one Gaussian Q-function, upper and lower bounds on the exact ASEP are obtained. The bounds can be made arbitrarily tight by adjusting the parameters in our Gaussian bounds. The average of the upper and lower bounds gives a very accurate approximation of the exact ASEP. Moreover, the arbitrarily accurate approximations for all three of the fading models we consider become invertible for reasonably high SNR.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2709-2712
• /
• 2003

In this paper, dynamic constraints are considered for the analysis of manipulability of robotics systems comprised of two cooperating arms. Given bounds on the torques of joint actuators for each robot, the purpose of this study is to derive the bounds of task acceleration of object carried by the system. Under the assumption of complete constraint contact, a set of examplar polytope describing acceleration bounds of two cooperating robots are included.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.4
• /
• pp.459-463
• /
• 2003

In this paper, new results using bounds for the solution of the discrete Lyapunov matrix equation are proposed, and some of the existing works are generalized. The bounds obtained are advantageous in that they provide nontrivial upper bounds even when some existing results yield trivial ones.

• Communications of the Korean Mathematical Society
• /
• v.16 no.4
• /
• pp.691-701
• /
• 2001

We computed zero mean Gaussian of average error bounds pf Simpsons quadrature with convariances in [2]. In this paper, we compute zero mean Gaussian of average error bounds between Simpsons quadrature and composite Simpsons quadra-ture on four consecutive subintervals. The reason why we compute these on subintervals is because these results enable us to compute a posteriori error bounds on the whole interval in the later paper.

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