• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 D
• /
• pp.2543-2545
• /
• 2005

It is well known that the orthogonal function is a very useful to estimate an unknown inputs in the linear dynamic systems for its recursive algebraic algorithm. At this aspects, derivative operation(matrix) of orthogonal functions(walsh, block pulse and haar) are introduced and shown how it can useful to design an UIO(unknown inputs observer) design.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제6권
• /
• pp.371-381
• /
• 1997

Let p be an odd prime number. We introduce simple and useful decoding algorithm for orthogonal Latin square codes of order p. Let H be the parity check matrix of orthogonal Latin square code. For any x ${\in}$ GF(p)$^{n}$, we call xH$^{T}$ the syndrome of x. This method is based on the syndrome decoding for linear codes. In L$_{p}$, we need to find the first and the second coordinates of codeword in order to correct the errored received vector.

• 한국통신학회논문지
• /
• 제11권4호
• /
• pp.251-258
• /
• 1986

TV와 같은 영상신호에는 중복도가 많이 존재하며, 이를 줄이기 위한 여러가지 방법들이 연구되고 있다. 본 논문에서는 Hadamard 변환을 이용하여 computer simulation과 실험 모델을 제작하여 데이터 압축에 관해 연구하였다. Hadamard matrix는 +1과 -1로 구성되며, row vector들은 서로 orthogonal하고 변환된 signal을 계산하기 위해서는 가산과 감산만이 필요하기 때문에 가산뿐 아니라 승산이 필요한 Fourier transform등 다른 orthogonal transform 에 비해 hardware구성이 용이하다. 링컨데이타 (64$ imes$64)를 8차와 16차 Hadamard 변환으로 simulation하였고, 8차를 hardware로 구성하였으며 이 경우 이론과 실험을 통해 연구한 결과 좋은 화질을 얻기 위해서는 2.0bits/sample가 필요했다.

• 대한수학회지
• /
• 제36권3호
• /
• pp.469-487
• /
• 1999

Sign patterns of idempotent matrices, especially symmetric idempotent matrices, are investigated. A number of fundamental results are given and various constructions are presented. The sign patterns of symmetric idempotent matrices through order 5 are determined. Some open questions are also given.

• Kyungpook Mathematical Journal
• /
• 제59권3호
• /
• pp.505-513
• /
• 2019

In this paper, we study orthanogonal polynomials by looking at their comrade matrices and reachability matrices. First, we focus on the algebraic structure that is exhibited by comrade matrices. Then, we explain some properties of this algebraic structure which helps us to find a connection between comrade matrices and reachability matrices. In the last section, we use this connection to determine the determinant, eigenvalues, and eigenvectors of these matrices. Finally, we derive a factorization for det R(A, x), where R(A, x) is the reachability matrix for a comrade matrix A and x is a vector of indeterminates.

• 전자공학회논문지B
• /
• 제31B권1호
• /
• pp.64-71
• /
• 1994

In this paper, we propose orthogonal integer transform(OIT) with general form. Considering the orthogonality and magnitude value order of the DCT Matrix whose performance is found to be close to that of the KLT, known to be optimal. The proposed OIT matrix is composed of values minimizing Hibert-Schmidt norm among integer values which satisfy the condition of orthogonality and the relative magnitudes of the DCT matrix. Comparing the OIT with the DCT, CMT, and ICT in error characteristics, transform efficiency, and maximum reducible bit, it is shown that the performance of the OIT compares more closely to that of the KLT relative to the performances of the DCT, CMT, and ICT when N=8.

• 한국전산유체공학회지
• /
• 제2권1호
• /
• pp.21-28
• /
• 1997

This paper presents a two-dimensional horizontal implicit model to general circulation in estuaries and coastal seas. The model is developed in non-orthogonal curvilinear coordinates system, using the Interpolating Matrix Method (IMM), in combination with a technique of multi-domain. In the propose model, the Saint-Venant equations are solved by a splitting-up technique, in the successive steps; convection, diffusion and wave propagation. The ability of the proposed model to deal with full scale nature is illustrated by the interpretation of a dye-tracing experiment in the Gironde estuary.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.97-109
• /
• 2001

This article is devoted to “forgotten” and rarely used technique of matrix analysis, introduced in 60-70th and enhanced by authors. We will study the matrix trace operator and it’s differentiability. This idea generalizes the notion of scalar derivative for matrix computations. The list of the most common derivatives is given at the end of the article. Additionally we point out a close connection of this technique with a least square problem in it’s classical and generalized case.

• 대한수학회지
• /
• 제57권4호
• /
• pp.973-986
• /
• 2020

In this paper, we compute the Hankel matrix representation of the Hankel operator on the Hardy space of a general bounded domain with respect to special orthonormal bases for the Hardy space and its orthogonal complement. Moreover we obtain the compact form of the Hankel matrix for the unit disc case with respect to these bases. One can see that the Hankel matrix generated by this computation turns out to be a generalization of the case of the unit disc from the single simply connected domain to multiply connected domains with much diversities of bases.

• 호남수학학술지
• /
• 제43권4호
• /
• pp.691-700
• /
• 2021

In this paper, we compute directly the Hankel matrix representation of the Hankel operator on the Hardy space of the unit disc without using any classical kernel functions with respect to special orthonormal bases for the Hardy space and its orthogonal complement. This gives an elementary proof for the formula.