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

• Journal of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.133-147
• /
• 2021

Our aim in this paper is to derive several new monotonicity properties and functional inequalities of some functions involving the q-gamma, q-digamma and q-polygamma functions. More precisely, some classes of functions involving the q-gamma function are proved to be logarithmically completely monotonic and a class of functions involving the q-digamma function is showed to be completely monotonic. As applications of these, we offer upper and lower bounds for this special functions and new sharp upper and lower bounds for the q-analogue harmonic number harmonic are derived. Moreover, a number of two-sided exponential bounding inequalities are given for the q-digamma function and two-sided exponential bounding inequalities are then obtained for the q-tetragamma function.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.6
• /
• pp.1259-1270
• /
• 2019

The upper bound of differential characteristic probability is mainly used to determine the number of rounds when constructing a block cipher. As the number of rounds affects the performance of block cipher, it is critical to evaluate the tight upper bound in the constructing process. In order to calculate the upper bound of differential characteristic probability, the previous searching methods for minimum number of active S-boxes constructed constraint equations for non-linear operations and linear operations, independently. However, in the case of BOGI design strategy, where linear operation is dependent on non-linear operation, the previous methods may present the less tight upper bound. In this paper, we exploit the properties of BOGI strategy to propose a new method to evaluate a tighter upper bound of differential characteristic probability than previous ones. Additionally, we mathematically proved the validity of our method. Our proposed method was applied to GIFT-64 and GIFT-128, which are based on BOGI strategy, and the upper bounds of differential characteristic probability were derived until 9 round. Previously, the upper bounds of differential characteristic probability for 7-round GIFT-64 and 9-round GIFT-128 were 2^-18.395 and 2^-26.885, respectively, while we show that the upper bounds of differential characteristic probability are more tight as 2^-19.81 and 2^-28.3, respectively.

• Structural Engineering and Mechanics
• /
• v.31 no.1
• /
• pp.113-116
• /
• 2009

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.1
• /
• pp.77-82
• /
• 2022

The effect of indoor air pollution on the human body is greater and more dangerous than outdoor air pollution. In general, a person stays indoors for a long time, and in a closed room, pollutants are continuously accumulated and the polluted air is better delivered to the lungs. Especially in the case of young children, it is very sensitive to indoor air and it is fatal. In addition, methods to reduce indoor air pollution, which cannot be ventilated with more frequent indoor activities and continuously increasing external fine dust due to Covid 19, are becoming more important. In order to improve the problems of the existing autonomous driving air purifying robot, this paper divided the map and Upper Confidence bounds applied to Trees(UCT) based algorithm to solve the problem of the autonomous driving robot not sterilizing a specific area or staying in one space continuously, and the problem of children who are vulnerable to indoor air pollution. We propose a space-adaptive autonomous driving air purifying robot for a green smart school that can be improved.

• Structural Engineering and Mechanics
• /
• v.13 no.3
• /
• pp.299-312
• /
• 2002

In this paper, a new method to solve the dynamic response problem for structures with interval parameters is presented. It is difficult to obtain all possible solutions with sharp bounds even an optimum scheme is adopted when there are many interval structural parameters. With the interval algorithm, the expressions of the interval stiffness matrix, damping matrix and mass matrices are developed. Based on the matrix perturbation theory and interval extension of function, the upper and lower bounds of dynamic response are obtained, while the sharp bounds are guaranteed by the interval operations. A numerical example, dynamic response analysis of a box cantilever beam, is given to illustrate the validity of the present method.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.145-149
• /
• 1991

In this paper, an algorithm is proposed to analyze the approximating reliability of the capacity considered communication networks. In the case ofthe former methods to evaluate the source-to-termianl node reliability, it is very difficult to contract and delete the jointed terms in the simple path group. Therefore, the reliability bounds are used and compared to the exact reliability by TURBO PROLOG, the natural lanquage of artficial intelligence. In the reliability bounds, the upper bound used the valid cutset that isthe group of simple path and the lower bound used the minimal cutset by complement operation and the esact reiability is compared to this reliability bounds.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.5
• /
• pp.311-318
• /
• 1988

An adaptive control problem for a plant with unmodelled dynamics is studied. The upper bounds of the output due to the unmodelled dynamics and measurement noise is assumed to be known. This problem was studied by Middleton et al. They used a modified form of the least square method in estimating the plant paramaters. In this paper, the bounds of the parameters are estimated by linear programming and the parameters are estimated by the projetion type algorithm incorporating the bounds of the parameters. The stability of the proposed adaptive control system can be proved in nearly the same way as the proof of Middleton. The performance of the proposed method is found to be much better than the method of Midlleton's with respect to the parameter convergence and plant output in computer simulations.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.1
• /
• pp.1-11
• /
• 2005

A network consisting of a set of N nodes and a set of links is considered. The nodes are assumed to be perfect and the states of links to be binary and associated to each other. After defining a network structure function, which represents the state of network as a function of the states of links, we obtain some lower and upper bounds on the network reliability by adopting minmax principle and minimal path and cut set arguments. These bounds are given as functions of the reliabilities of links. The bridge network is considered as an example.

• Journal of Information Technology Services
• /
• v.9 no.3
• /
• pp.107-121
• /
• 2010

In this paper, we present a frequency reassignment problem (FRP) that arises when we install new base stations or reconfigure radio networks to increase the capacity or to expand service area. For this problem, we develop an integer programming (IP) model, and develop cutting planes to enhance the mathematical representation of the model. Also, we devise an effective tabu search algorithm to obtain tight upper bounds within reasonable time bounds. Computational results exhibit that the developed cutting planes are effective for reducing the computing time as well as for increasing lower bounds. Also, the proposed tabu search algorithm finds a feasible solution of good quality within reasonable time bound.