• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3458-3481
• /
• 2021

Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.

• 전기의세계
• /
• 제23권3호
• /
• pp.43-52
• /
• 1974

The matrix inversion is very inefficient for computing direct solutions of the large spare systems of linear equations that arise in many network problems as a large electrical power system. Optimally ordered triangular factorization of sparse matrices is more efficient and offers the other important computational advantages in some applications with this method. The direct solutions are computed from sparse matrix factors instead of a full inverse matrix, thereby gaining a significant advantage is speed and computer memory requirements. In this paper, it is shown that the sparse matrix method is superior to the inverse matrix method to solve the linear equations of large sparse networks. In addition, it is shown that the sparse matrix method is superior to the inverse matrix method to solve the linear equations of large sparse networks. In addition, it is shown that the solutions may be applied directly to sove the load flow in an electrical power system. The result of this study should lead to many aplications including short circuit, transient stability, network reduction, reactive optimization and others.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제24권3호
• /
• pp.243-291
• /
• 2020

In this paper, multi-block generalized backward differentiation methods for numerical solutions of ordinary differential and differential algebraic equations are introduced. This class of linear multi-block methods is implemented as multi-block boundary value methods (MB₂ VMs). The root distribution of the stability polynomial of the new class of methods are determined using the Wiener-Hopf factorization of a matrix polynomial for the purpose of their correct implementation. Numerical tests, showing the potential of such methods for output of multi-block of solutions of the ordinary differential equations in the new approach are also reported herein. The methods which output multi-block of solutions of the ordinary differential equations on application, are unlike the conventional linear multistep methods which output a solution at a point or the conventional boundary value methods and multi-block methods which output only a block of solutions per step. The MB₂ VMs introduced herein is a novel approach at developing very large scale integration methods (VLSIM) in the numerical solution of differential equations.

• Journal of Mechanical Science and Technology
• /
• 제19권spc1호
• /
• pp.227-236
• /
• 2005

Multibody system dynamics is based on classical mechanics and its engineering applications originating from mechanisms, gyroscopes, satellites and robots to biomechanics. Multibody system dynamics is characterized by algorithms or formalisms, respectively, ready for computer implementation. As a result simulation and animation are most convenient. Recent developments in multibody dynamics are identified as elastic or flexible systems, respectively, contact and impact problems, and actively controlled systems. Based on the history and recent activities in multibody dynamics, recursive algorithms are introduced and methods for dynamical analysis are presented. Linear and nonlinear engineering systems are analyzed by matrix methods, nonlinear dynamics approaches and simulation techniques. Applications are shown from low frequency vehicles dynamics including comfort and safety requirements to high frequency structural vibrations generating noise and sound, and from controlled limit cycles of mechanisms to periodic nonlinear oscillations of biped walkers. The fields of application are steadily increasing, in particular as multibody dynamics is considered as the basis of mechatronics.

• 한국철도학회논문집
• /
• 제2권1호
• /
• pp.47-55
• /
• 1999

In this paper, an efficient and accurate formulation for the transient analysis of constrained multibody systems is presented. The formulation employs Kane's method along with the null space method. Kane's method reduces the dimension of equations of motion by using partial velocity matrix: it can improve the efficiency of the formulation. Furthermore, the formulation partitions the coefficient matrix of linear and nonlinear equations into several sub-matrices using kinematic uncoupling. This can solve the equations more efficiently. The proposed formulation can be used to perform dynamic analysis of systems which can be partitioned into several sub-systems such as train systems. One numerical example is given to demonstrate the efficiency and accuracy of the formulation, and another numerical example is given to show its application to the train systems.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 1998년도 추계학술대회 논문집
• /
• pp.437-444
• /
• 1998

In this paper, an efficient and accurate formulation for the transient analysis of constrained multibody systems is presented. The formulation employs Kane's method along with the null space method. Kane's method reduces the dimension of equations of motion by using partial velocity matrix: it can improve the efficiency of the formulation. Furthermore, the formulation partitions the coefficient matrix of linear and nonlinear equations into several sub-matrices using kinematic uncoupling. This can solve the equations more efficiently. The proposed formulation can be used to perform dynamic analysis of systems which can he partitioned into several sub-systems such as train systems. One numerical example is given to demonstrate the efficiency and accuracy of the formulation, and another numerical example is given to show its application to the train systems.

• 제어로봇시스템학회논문지
• /
• 제9권7호
• /
• pp.556-562
• /
• 2003

This paper presents new attitude error differential equations to define attitude errors as the rotation vector for inertial navigation systems. Attitude errors are defined with the rotation vector between the reference coordinate frame and the platform coordinate frame, and Platform dynamics to the reference coordinate frame due to platform torque command errors are defined. Using these concepts for attitude error definition and platform dynamics, we have derived attitude error differential equations expressed in original nonlinear form for GINS and SDINS and showed that these are equivalent to attitude error differential equations expressed in known linear form. The relation between attitude errors defined by the rotation vector and attitude errors defined by quaternion is clearly presented as well.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.208-213
• /
• 1992

In this paper we are concerned with optimal control problems whose costs am quadratic and whose states are governed by linear delay equations and general boundary conditions. The basic new idea of this paper is to Introduce a new class of linear operators in such a way that the state equation subject to a starting function can be viewed as an inhomogeneous boundary value problem in the new linear operator equation. In this way we avoid the usual semigroup theory treatment to the problem and use only linear operator theory.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.167-183
• /
• 2002

A modified discretization ABS algorithm for solving a class of singular nonlinear systems, F($\chi$)=0, where $\chi$, F $\in$ $R^n$, is presented, constructed by combining a discretization ABS algorithm arid a method of Hoy and Schwetlick (1990). The second order differential operation of F at a point is not required to be calculated directly in this algorithm. Q-quadratic convergence of this algorithm is given.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.199-199
• /
• 2000

Most of linear time-varying(LTV) systems except special cases have no general solution for the dynamic equations. Thus, it is difficult to design time-varying controllers in analytic ways, and other control design approaches such as robust control have been applied to control design for uncertain LTI systems which are the approximation of LTV systems have been generally used instead. A robust control method such as quantitative feedback theory(QFT) has an advantage of guaranteeing the stability and the performance specification against plant parameter uncertainties in frozen time sense. However, if these methods are applied to the approximated linear time-invariant(LTI) plants which have large uncertainty, the designed control will be constructed in complicated forms and usually not suitable for fast dynamic performance. In this paper, as a method to enhance the fast dynamic performance, the approximated uncertainty of time-varying parameters are reduced by the proposed QFT parameter-scheduling control design based on radial basis function (RBF) networks for LTV systems with bounded time-varying parameters.