• ETRI Journal
• /
• v.45 no.2
• /
• pp.277-290
• /
• 2023

This paper proposes a method that can reduce the complexity of a system matrix by analyzing the characteristics of a pseudoinverse matrix to receive a binomial frequency division multiplexing (BFDM) signal and decode it using the least squares (LS) method. The system matrix of BFDM can be expressed as a band matrix, and as this matrix contains many zeros, its amount of calculation when generating a transmission signal is quite small. The LS solution can be obtained by multiplying the received signal by the pseudoinverse matrix of the system matrix. The singular value decomposition of the system matrix indicates that the pseudoinverse matrix is a band matrix. The signal-to-interference ratio is obtained from their eigenvalues. Meanwhile, entries that do not contribute to signal generation are erased to enhance calculation efficiency. We decode the received signal using the pseudoinverse matrix and the removed pseudoinverse matrix to obtain the bit error rate performance and to analyze the difference.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.11
• /
• pp.1146-1152
• /
• 1990

Direct calculation algorithm for the nonzero elements of system matrix is suggested for a single machine connected to the infinite bus. Excitation system and power system stabilizer are included. When the system matrix is partitioned into 15 nonzero blocks, we can identify the location of nonzero elements and formula for each element. No matrix inversion and multiplication are necessary. Sensitivity coefficients with respect to controller parameters are suggested based on the structure of system matrix.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.105-109
• /
• 2008

A robust optimal control system design algorithm in active suspension equipment adopting linear matrix inequalities control system design theory is presented. The validity of the linear matrix inequalities robust control system design in active suspension system through the numerical examples is also investigated.

• East Asian mathematical journal
• /
• v.35 no.3
• /
• pp.341-349
• /
• 2019

In this paper, we are concerned with the minimal positive solution to system of the nonlinear matrix equations $A_1X^2+B_1Y +C_1=0$ and $A_2Y^2+B_2X+C_2=0$, where $A_i$ is a positive matrix or a nonnegative irreducible matrix, $C_i$ is a nonnegative matrix and $-B_i$ is a nonsingular M-matrix for i = 1, 2. We apply Newton's method to system and present a modified Newton's iteration which is validated to be efficient in the numerical experiments. We prove that the sequences generated by the modified Newton's iteration converge to the minimal positive solution to system of nonlinear matrix equations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.50-50
• /
• 1993

이 연구는 선형계획법을 위하여 개발된 프로그램들의 언어 및 자료 구조에 대한 차이를 비교, 분석하고자 한다. 선형계획법을 위하여 사용된 언어로는 C, PASCAL, FORTRAN이 있고 자료구조로는 Full Matrix형태와 Non-Zero Matrix형태를 고려한다. Non-Zero Matrix에서는 프로그램 언어별로 Cursor-Based System을 비교하고자 한다. 위의 실험을 수행하기 위하여 다음의 연구과정을 수행한다. 첫째, Non-Zero Matrix의 이용을 위한 Cursor-Based System과 Pointer-Based System을 설계한다. 둘째, LP프로그램을 위한 Full Matrix와 Non-Zero Matrix의 효율적인 자료구조를 구축한다. 세째, 프로그램 언어와 자료구조별로 LP프로그램의 성능을 비교분석한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.105-108
• /
• 1997

This paper proposes a new approach of balanced model reduction using matrix pencil. The algorithm presented in this paper is to convert full-rank high-order system into rank-deficient system using perturbation made by matrix pencil method. Then the system can be truncated to a low-order system that we want via balanced realization. We discuss the comparison with other methods and the various observations by simulations.

• Kyungpook Mathematical Journal
• /
• v.48 no.3
• /
• pp.473-486
• /
• 2008

In this paper we generate a fuzzy dynamical matrix Lyapunov system and obtain a sufficient condition for the observability of this system.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.5
• /
• pp.52-62
• /
• 1993

This paper describes the implementation of a layout generation system for the gate matrix style to implement multi-level logic. To achieve improved layouts from general net lists, the proposed system performs flexible net binding for series nets. Also the system reassings gates by the heuristic information that shorter net lengths are better for the track minimization. By track minimizing with subdividing layout column information, the system decreases the number of necessary layout tracks. Experimental results show that the system generates more area-reduced (approximately 7.46%) layouts than those by previous gate matrix generation systems using net list inputs.

• Journal of the korean academy of Pediatric Dentistry
• /
• v.50 no.4
• /
• pp.396-408
• /
• 2023

The purpose of this study was to compare the proximal surface contour, size of contact area, and volume difference before and after restoration in artificial teeth of primary molars during proximal composite resin restoration using different matrix systems. Four types of artificial teeth were restored with composite resin using sectional matrix systems-Palodent V3 Sectional Matrix System and myJunior Kitand a circumferential matrix system-Tofflemire Matrix System-and modeled threedimensionally for analysis. When sectional matrix systems were used, there was a higher probability of concave proximal surface contour and simultaneously greater contact area and volume. This is attributed to the dead soft properties of the matrix band used in sectional matrix systems, which can lead to deformation of the band and hence an excessive amount of resin applied around the contact point. Additionally, the rubber wedge in the sectional matrix system may not help the matrix band fit into the cavity. Therefore, based on the findings of this study, morphological aspects need to be carefully considered for proximal composite resin restoration of primary molars using sectional matrix systems.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.32 no.12
• /
• pp.435-440
• /
• 1983

The methods of forming the bus impedance matrix, which is mainly employed in fault analysis of power system, can be generally classified in catagories, (1) the one being the inverse matrix of bus admittance matrix, and (2) the other the bus impedance matrix succesive formation method by particular algorithms. The former method is theouetically elegant, but the formation and inverse of complex bus admittance matrix for large power system requires too much amounts of computer memory space and computing time. The latter method also requires too much memory space. Therefore, in this paper, an algorithm and computer program is introduced for the formation of a sparse bus impedance matrix which generates only the matching terms of the admittance matrix. So, this method can reduce the computer memory and computing time, and can be applied to fault analysis of large power system by small digital computer.