• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.1985-1996
• /
• 1998

A parallelising algorithm for partitioning and mapping methods of matrix/vector multiplication into linear processor array/VLW simulator is presented in this paper. First we discuss the mapping methods for input matrix or vector into the arbitrarily size of processor arrays. Then, we show partitioning the algorithmss of the large size of computational problem into the size of the processor array. We execute the algorithm on VLIW simuhator and show to effectiviness of algorithm. The result which we achived better parallelising performance on our VLIW simulator dsign than on linear processor array.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.11
• /
• pp.185-190
• /
• 2000

비선형 시스템에 대한 $Η_{\infty}$ 제어 이론은 에너지 소진(energy dissipation) 개념을 기초로 개발되어 왔다. 에너지 소진을 이용한 비선형 $Η_{\infty}$ 제어기는 외란과 성능 벡터 사이의 $L_2$게인의 비를 일정이하로 만드는 방법으로 설계되고, 그 적용을 위해서는 헤밀턴 자코비 부등식의 해를 구하는 것이 필수적이지만, 일반적으로 헤밀턴 자코비 부등식의 해를 구하는 것은 매우 어렵다. 본 논문에서는 로봇 매니퓰레이터의 운동방정식을 변형하여 헤밀턴 자코비 부등식의 해를 구하기 쉬운 형태, 즉 비선형 행렬 부등식으로 표현하고, 운동 방적식을 구성하는 행렬의 각 항들이 한계가 존재한다는 것을 이용하여 그 부등식의 근사해를 구하였다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.183-187
• /
• 2000

본 논문에서는 불확실성을 가지는 TS 퍼지 시스템을 안정화시킬 수 있는 제어기를 제안하고, 선형행렬부등식(Linear Matrix Inequality : LMI)을 이용한 설계 방법을 제시하였다. 그리고, 간단한 예제를 통하여 제안된 기법의 응용 가능성을 확인하여 보았다.

• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.13 no.3
• /
• pp.246-251
• /
• 2008

The conceptual design evaluation of Deep-Sea Manganese Nodule Miner(DSNM) based on Axiomatic Design was preformed. Functional Requirements(FRs) in functional domain and Design Parameters(DPs) in physical domain were embodied for the given concept design of DSNM. Interactions between FRs and DPs were sequentially analyzed from the first level hierarchy to the lower level hierarchy. The interactions were expressed as design matrices which showed the dependence or independence between FRs and DPs. The results showed that the design of DSNM was not a coupled one, but a decoupled. Finally, it was conceptually verified that DSNM was a good design satisfying the independence axiom of the Axiomatic Design.

• Journal of the Korean School Mathematics Society
• /
• v.13 no.1
• /
• pp.125-141
• /
• 2010

The aim of this paper is to develop a web-based Virtual Learning System for discrete mathematics learning using CAS (Computer Algebra System), The system contains a series of contents that are common between secondary und university curriculum in discrete mathematics such as sets, relations, matrices, graphs etc. We designed and developed web-based virtual learning contents contained in the proposed system based on Mathematia, webMathematica and phpMath taking advantages of rapid computation and visualization. The virtual learning system for discrete math provides movie lectures and 'practice mode' authored with phpMath in order to enhance conceptual understanding of each movie lesson. In particular, matrix learning is facilitated with conceptual diagram that provides interactive quizzes. Once the quiz results are submitted, Bayesian inference network diagnoses strong and weak parts of learning nodes for generating diagnostic reports to facilitate personalized learning. As part of formative evaluation, the overall responses were collected for future revision of the system with 10 university students.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.189-196
• /
• 2012

A WAVE(Wireless Access for Vehicular Environment) system is a vehicle communication technology. The system provides the services to prevent vehicle accidents that might occur during driving. Also, it is used to provide various services such as monitoring vehicle management and system failure. However, the scrambler bit operation of WAVE system becomes less efficient in the organizations of software and hardware design because the parallel processing is impossible. Although scrambler algorithm proposed in this paper has different processing speed depending on input data 8 bit, 16 bit, 32 bit, and 64 bit. it improves the processing speed of the operation because it can make parallel processing possible depending on the input unit.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.4
• /
• pp.602-610
• /
• 2018

The model predictive control is an effective method to optimize the current control input that predicts the current control state and the future error using the predictive model of the control system when the reference trajectory is known. Since the control input can not have a physically infinitely large value, a predictive controller design with constraints should be considered. In addition, the reference model $A_r$ and the weight matrices Q, R that determine the control performance of the predictive controller are not optimized as arbitrarily designated should be considered in the controller design. In this study, we construct a predictive controller of a mobile robot by transforming it into a quadratic programming problem with constraints, The control performance of the mobile robot can be improved by optimizing the control parameters of the predictive controller that determines the control performance of the mobile robot using genetic algorithm. Through the computer simulation, the superiority of the proposed method is confirmed by comparing with the existing method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.3
• /
• pp.533-540
• /
• 2021

To evaluate the performance of a system, one-dimensional 3-neighborhood cellular automata(CA) based pseudo-random generators are widely used in many fields. Although two-dimensional CA and one-dimensional 5-neighborhood CA have been applied for more effective key sequence generation, designing symmetric one-dimensional 5-neighborhood CA corresponding to a given primitive polynomial is a very challenging problem. To solve this problem, studies on one-dimensional 5-neighborhood CA synthesis, such as synthesis method using recurrence relation of characteristic polynomials and synthesis method using Krylov matrix, were conducted. However, there was still a problem with solving nonlinear equations. To solve this problem, a symmetric one-dimensional 5-neighborhood CA synthesis method using a transition matrix of 90/150 CA and a block matrix has recently been proposed. In this paper, we detail the theoretical process of the proposed algorithm and use it to obtain symmetric one-dimensional 5-neighborhood CA corresponding to high-order primitive polynomials.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.2
• /
• pp.106-112
• /
• 2007

This paper proposes a hybrid architecture algorithm for fast computation of DCT and DFT via recursive factorization. Recursive factorization of DCT-II and DFT transform matrix leads to a similar architectural structure so that common architectural base may be used by simply adding a switching device. Linking between two transforms was derived based on matrix recursion formula. Hybrid acrchitectural design for DCT and DFT matrix decomposition were derived using the generation matrix and the trigonometric identities and relations. Data flow diagram for high-speed architecture of Cooley-Tukey type was drawn to accommodate DCT/DFT hybrid architecture. From this data flow diagram computational complexity is comparable to that of the fast DCT algorithms for moderate size of N. Further investigation is needed for multi-mode operation use of FFT architecture in other orthogonal transform computation.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2711-2720
• /
• 1997

Multitasking and microtasking on the CRAY machine provides still another way to improve computational power. Since CRAY-2 has 4 processors we can achieve speedup up to 4 properly designed algorithms. In this paper we present two parallelizations of linear system solution in the CRAY-2 with multitasking and microtasking library. One is the LU decomposition on the dense matrices and the other is the iterative solution of large sparse linear systems with the preconditioner proposed by Radicati di Brozolo. In the first case we realized a speedup of 1.3 with 2 processors for a matrix of dimension 600 with the multitasking and in the second case a speedup of around 3 with 4 processors for a matrix of dimension 600 with the multitasking and in the second case a speedup of around 3 with 4 processors for a matrix of dimension 8192 with the microtasking. In the first case the speedup is limited because of the nonuniform vector lenghts. In the second case the ILU(0) preconditioner with Radicati's technique seem to realize a reasonable high speedup with 4 processors.