• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.2
• /
• pp.115-123
• /
• 1997

이산기간 H/sub .inf./ 제어에 의한 최적 예견제어기를 제안한다. 기존의 H/sub .inf./ 제어기는 미지의 외란만 고려한 것이고, LQ 에 의한 예견제어기는 예견 가능한 외란과 미지의 외란이 동시에 가해지는 동적 시스템의 전달함수 행렬의 infinity 놈의 최소화하는 피드백제어기가 동시에 설계된다. 제어기의 설계는 full-information H/sub .inf./ 제어 이론을 따르나, 그 유도 과정은 LQ 에 기초한 예견제어기와 유사하게 이루어진다. 설계된 H/sub .inf./ 예견 게인 행렬은 LQ 예견 게인 행렬과 유사한 구조를 갖는다. 전달함수 행렬의 infinity 놈이 .inf.로 갈수록 H/sub .inf./ 예견 게인 행렬은 LQ에 의한 것에 접근한다. LQ 예견 게인 행렬은 H/sub .inf./ 예견 게인 행렬의 부분 집합임이 입증한다.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2239-2241
• /
• 2004

이 논문은 최적 제어 설계방법 중 하나인 LQR 제어기의 과도 상태를 개선하는 방법에 관한 연구이다. 적절한 상태가중행렬과 제어가중행렬을 설정한 후 대수 Riccati 방정식을 풀면 LQR 제어기가 설계된다. 그런데 이 가중행렬은 시행착오 방법을 이용하여 설정하기 때문에 설계된 제어기의 과도 상태를 개선하기 하기가 매우 어렵다. 이러한 문제점을 해결하기 위한 방법으로 closed-loop 근과 가중행렬과의 상관관계를 수학적으로 표현하고, 이를 바탕으로 설계조건을 만족하도록 시스템의 근을 이동시키는 가중행렬을 구하는 방법을 제시한다. 원운동형 도립진자(rotary type inverted pendulum)를 통해 matlab 모의실험으로 그 타당성을 검증한다. 얻어진 결과를 이용하면 원하는 극점을 갖는 LQR 제어기를 체계적으로 설계할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1346-1353
• /
• 2007

In this paper, the methods are presented for the calculation of general coupling coefficient matrixes used in the band pass filter design. They are calculated from transmission coefficient($S_{21}$) and reflection coefficient($S_{11}$) with desired characteristics derived from the poles of filter function and return loss(RL). The calculated matrixes from this method are transformed to the folded canonical filter structure using similarity transformation which lends us the practical filter design. Based on the resulting matrix, the folded canonical filter has been designed.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.994-997
• /
• 2003

행렬 연산은 계산 과학을 사용하는 공학 물리, 화학, 생명 과학, 경제학 등에서 다양하게 사용되고 있으며 이 행렬은 크기가 크고 대부분의 원소가 0 값을 갖는 희소 행렬일 경우가 많다. 본 논문에서는 희소 행렬의 연산 중, 회로 설계 시 최적화 과정에 사용되는 연산에서 문제가 되는 희소 행렬 A 와 블록 대각 행렬 H에 대하여 AH$A^{T}$ 의 연산을 효율적으로 행하는 방법들을 검토하고 메모리 접근 횟수를 모델링하여 수행 속도와 메모리 사용량 면에서 비교한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.1
• /
• pp.20-27
• /
• 2020

In general, a nonlinear system is linearized in the form of a multiplication of the 1st and 2nd order system. This paper reports a design method of a weighting matrix and control law of LQ control to move the double poles that have a Jordan block to a pair of complex conjugate poles. This method has the advantages of pole placement and the guarantee of stability, but this method cannot position the poles correctly, and the matrix is chosen using a trial and error method. Therefore, a relation function (𝜌, 𝜃) between the poles and the matrix was derived under the condition that the poles are the roots of the characteristic equation of the Hamiltonian system. In addition, the Pole's Moving-range was obtained under the condition that the state weighting matrix becomes a positive semi-definite matrix. This paper presents examples of how the matrix and control law is calculated.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.02a
• /
• pp.25-28
• /
• 2008

Shirai 등은 FSE'04에서 DSM 설계 원리를 적용하여 증명 가능한 Feistal 구조를 제안하였다. 제안된 구조는 임의의 라운드 수에 대하여 능동 S-box의 최소 개수를 증명할 수 있다. 그러나 제안된 구조에 제약된 조건을 만족하는 행렬이 존재함을 증명하지 못하였다. 본 논문에서는 DSM 설계 원리에 최대 branch number를 갖는 $m{\times}m$ 이진 행렬을 적용하였을 경우 동일한 최대 branch number를 가지지 못함을 증명 한다$(m{\leq}34)$. 이는 이진 행렬을 이용하여 Shirai 등이 제안한 구조를 설계할 수 없음을 의미한다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.2
• /
• pp.168-174
• /
• 2000

All the visiting customers makes a queue and then can be served at an unoccupied server, in the queueing system of multi-server. The customer and server, however, have a conflictive feeling of satisfaction at all times. To solve the problem, in this paper, it is proposed that new design method of server number to maximize the satisfaction level of customer and server by the hzzy concept which is applied to the queuing system.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.117-124
• /
• 2012

In this paper, we propose a simple H parity check matrix from the CPM(circulant permutation matrix), which can easily avoid the cycle-4, and approach to flexible code rates and lengths. As a result, the operations of the submatrices will become the multiplications between several CPMs, the calculations of the LDPC(low density parity check) encoding could be simplest. Also we consider the fast encoding problem for LDPC codes. The proposed constructions could lead to fast encoding based on the simplest matrices operations for both regular and irregular LDPC codes.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.6 no.6
• /
• pp.49-53
• /
• 2002

This paper provides the systematic procedure to determine the weighting matrices of optimal controllers considering structural energy. Optimal controllers consist of LQR and ILQR. The weighting matrices are needed first in the conventional optimal control design strategy. However, they are in general dependent on the experienced knowledge of control designers. Applying the Lyapunov function to total structural energy and using the condition that its derivative is negative, we can determine the weighting matrices without difficulty. It is proven that the control efficiency with using determined weighting matrices is achieved well for LQR and ILQR controllers.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.27-34
• /
• 2011

In this paper, it was presented a design on the dynamic multimedia fingerprinting code for anti-collusion code(ACC) in the protection of multimedia content. Multimedia fingerprinting code for the conventional ACC, is designed with a mathematical method to increase k to k+1 by transform from BIBD's an incidence matrix to a complement matrix. A codevector of the complement matrix is allowanced fingerprinting code to a user' authority and embedded into a content. In the proposed algorithm, the feature points were drawing from a content which user bought, with based on these to design the dynamical multimedia fingerprinting code. The candidate codes of ACC which satisfied BIBD's v and k+1 condition is registered in the codebook, and then a matrix is generated(Below that it calls "Rhee matrix") with ${\lambda}+1$ condition. In the experimental results, the codevector of Rhee matrix based on a feature point of the content is generated to exist k in the confidence interval at the significance level ($1-{\alpha}$). Euclidean distances between row and row and column and column each other of Rhee matrix is working out same k value as like the compliment matrices based on BIBD and Graph. Moreover, first row and column of Rhee matrix are an initial firing vector and to be a forensic mark of content protection. Because of the connection of the rest codevectors is reported in the codebook, when trace a colluded code, it isn't necessity to solve a correlation coefficient between original fingerprinting code and the colluded code but only search the codebook then a trace of the colluder is easy. Thus, the generated Rhee matrix in this paper has an excellent robustness and fidelity more than the mathematically generated matrix based on BIBD as ACC.