• 정보보호학회논문지
• /
• 제15권4호
• /
• pp.101-105
• /
• 2005

2002년 Zheng은 대각행렬을 이용한 공개키 암호시스템을 소개하였다. 그러나 이 시스템은 근본적으로 안전성에 문제가 있었다. 이러한 문제점을 보완한 새로운 공개키 암호시스템을 소개하려고 한다. 이 시스템은 합성수 상의 합동다항식의 해를 구하는 것과 조르단 형식의 행렬을 이용한다.

• 전기학회논문지P
• /
• 제63권3호
• /
• pp.200-205
• /
• 2014

In this paper, 5.8GHz band $4{\times}4$ Butler matrix is designed using easily accessible commercial $90^{\circ}$ hybrid coupler and semirigid coaxial cable as a transmission line. This Butler matrix is very flexible to changes of antenna system specification like a frequency band because $90^{\circ}$ hybrid coupler changing is all to do. The result of design is the distance of $2{\times}2$ array antenna element is $\sqrt{2}{\lambda}/4$, the 4 beam directions are diagonal of array antenna and phase shifter is not necessary. The beam width is roughly $25^{\circ}$ narrower because of array antenna geometry and the side lobe is about 10dB higher partially than theoretical beam pattern. But the overall beam pattern is similar with theoretical beam. This Butler matrix can be applied to switching beam antenna of 5.8GHz band Wi-Fi and WAVE system.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권9호
• /
• pp.1081-1087
• /
• 1999

Load Flow calulation methods can usually be divided into Gauss-Seidel method, Newton-Raphson method and decoupled method. Load flow calculation is a basic on-line or off-line process for power system planning. operation, control and state analysis. These days Newton-Raphson method is mainly used since it shows remarkable convergence characteristics. It, however, needs considerable calculation time in construction and calculation of inverse Jacobian matrix. In addition to that, Newton-Raphson method tends to fail to converge when system loading is heavy and system has a large R/X ratio. In this paper, matrix equation is used to make algebraic expression and then to slove load flow equation and to modify above defects. And it preserve P-Q bus part of Jacobian matrix to shorten computing time. Application of mentioned algorithm to 14 bus, 39 bus, 118 bus systems led to identical results and the same numbers of iteration obtained by Newton-Raphson method. The effect of computing time reduction showed about 28% , 30% , at each case of 39 bus, 118 bus system.

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.370-382
• /
• 2013

Distributed massive MIMO systems, which have high bandwidth efficiency and can accommodate a tremendous amount of traffic using algorithms such as zero-forcing beam forming (ZFBF), may be deployed in large public venues with the antennas mounted under-floor. In this case the channel gain matrix H can be modeled as a multi-banded matrix, in which off-diagonal entries decay both exponentially due to heavy human penetration loss and polynomially due to free space propagation loss. To enable practical implementation of such systems, we present a multi-banded matrix inversion algorithm that substantially reduces the complexity of ZFBF by keeping the most significant entries in H and the precoding matrix W. We introduce a parameter p to control the sparsity of H and W and thus achieve the tradeoff between the computational complexity and the system throughput. The proposed algorithm includes dense and sparse precoding versions, providing quadratic and linear complexity, respectively, relative to the number of antennas. We present analysis and numerical evaluations to show that the signal-to-interference ratio (SIR) increases linearly with p in dense precoding. In sparse precoding, we demonstrate the necessity of using directional antennas by both analysis and simulations. When the directional antenna gain increases, the resulting SIR increment in sparse precoding increases linearly with p, while the SIR of dense precoding is much less sensitive to changes in p.

• Journal of the Korean Statistical Society
• /
• 제15권2호
• /
• pp.131-142
• /
• 1986

By using the tool for finding influential cases in regrssion, we investigate teh properties of three types of diagonal elements of the hat matrix in central designs. From thses results, we determine the experimental points at axes ad teh number of replicates as the center and the otherpoints so that the experimental points give approximatly same influences to estimatoe teh response surface.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.366-370
• /
• 2003

This paper is on weighted model reduction using structurally balanced truncation. For a given weighted(single or double-sided) transfer function, a state space realization with the linear fractional transformation form is obtained. Then we prove that two block diagonal LMI(linear matrix inequality) solutions always exist, and it is possible to get a reduced order model with guaranteed stability and a priori error bound. Finally, two examples are used to show the validity of proposed weighted reduction method, and the method is compared with other existing methods.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 춘계학술대회 논문집
• /
• pp.330-335
• /
• 1996

The well-conditioned observer design method is extended for two-output systems where observer gains are not determined uniquely with respect to the desired observer poles. Similar to the previous results, this design method makes off-diagonal elements of the observer upper-left submatrix skew-symmetric and simulataneously, places the eigenvalues of the observer matrix widely separated by selecting upper two rows of the observer gain. The proposed design method is evaluated in a spindle-drive example where the load speed is estimated based on motor speed and the armature current.

• 대한수학회보
• /
• 제47권5호
• /
• pp.951-960
• /
• 2010

We provide the set of left-invariant minimal unit vector fields on the semi-direct product $\mathbb{R}^n\;{\rtimes}_p\mathbb{R}$, where P is a nonsingular diagonal matrix and on the 7 classes of 4-dimensional solvable Lie groups of the form $\mathbb{R}^3\;{\rtimes}_p\mathbb{R}$ which are unimodular and of type (R).

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.1-23
• /
• 2005

The decentralized static output feedback design problem is considered. A constrained trust region method is developed that solves this optimal control problem when a complete set of state variables is not available. The considered problem is interpreted as a non-linear (non-convex) constrained matrix optimization problem. Then, a decentralized constrained trust region method is developed for this problem class exploiting the diagonal structure of the problem and using inexact computations. Finally, numerical results are given for the proposed method.

• 전기의세계
• /
• 제31권5호
• /
• pp.355-360
• /
• 1982

In numerical computation, it is desirable to access any row or column, the main diagonal, subarrays, of a matrix without any conflict for successful parallel processing. To meet this requirement special storage scheme is used for conflict-free access of necessary data. Interconnection network, which connects processing elements and processing element memory modules, is required to execute the necessary operations. In this paper we discuss the skewing method for conflict-free, access to various bit slices and single-stage interconnection networks.