• Title/Summary/Keyword: 역행렬

Search Result 163, Processing Time 0.033 seconds

Calculating Method of FRF with Sub-structure Mode Synthesis Method (부분구조 모드합성법에 의한 주파수응답함수 산출법)

  • Oh, Chang-Guen;Park, Kyung-Il;Park, Sok-Chu
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.39 no.4
    • /
    • pp.393-398
    • /
    • 2015
  • A very important part in vibration analysis is to calculate the frequency response function (FRF). In general, a large sized or/and complicated structure has many thousands to millions of degrees. Therefore, the FRF cannot be calculated by the traditional analysis method using an inverse matrix. This paper presents a new FRF calculation method of a superstructure by synthesizing sub-structure modes, of which the DOF can be deduced by partitioning into some sub-structures. To confirm its analysis results, the method was applied to an assembled plate ($B300{\times}L900{\times}t5mm$) with three diagonal sub-plates($B300{\times}L300{\times}t5mm$) in series and compared with the measured data. The test results have were comparable those of the calculated ones with an error less than 5%.

Conductivity Image Reconstruction Using Modified Gauss-Newton Method in Electrical Impedance Tomography (전기 임피던스 단층촬영 기법에서 수정된 가우스-뉴턴 방법을 이용한 도전율 영상 복원)

  • Kim, Bong Seok;Park, Hyung Jun;Kim, Kyung Youn
    • Journal of IKEEE
    • /
    • v.19 no.2
    • /
    • pp.219-224
    • /
    • 2015
  • Electrical impedance tomography is an imaging technique to reconstruct the internal conductivity distribution based on applied currents and measured voltages in a domain of interest. In this paper, a modified Gauss-Newton method is proposed for conductivity image reconstruction. In the proposed method, the dimension of the inverse term is reduced by replacing the number of elements with the number of measurement data in the conductivity updating equation of the conventional Gauss-Newton method. Therefore, the computation time is greatly reduced as compared to the conventional Gauss-Newton method. Moreover, the regularization parameter is selected by computing the minimum-maximum from the diagonal components of the Jacobian matrix at every iteration. The numerical experiments with several scenarios were carried out to evaluate the reconstruction performance of the proposed method.

Optimal Non-Uniform Resampling Algorithm (최적 비정규 리샘플링 알고리즘)

  • Sin, Geon-Sik;Lee, Hak-Mu;Gang, Mun-Gi
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.2
    • /
    • pp.50-55
    • /
    • 2002
  • The standard approach of image resampling is to fit the original image with continuous model and resample the function at a desired rate. We used the B-spline function as the continuous model because it oscillates less than the others. The main purpose of this paper is the derivation of a nonuniform optimal resampling algorithm. To derive it, needing approximation can be computed in three steps: 1) determining the I-spline coefficients by matrix inverse process, 2) obtaining the transformed-spline coefficients by the optimal resampling algorithm derived from the orthogonal projection theorem, 3) converting of the result back into the signal domain by indirect B-spline transformation. With these methods, we can use B-spline in the non-uniform resampling, which is proved to be a good kernel in uniform resampling, and can also verify the applicability from our experiments.

An Efficient Channel Tracking Method in MIMO-OFDM Systems (MIMO-OFDM에서 효율적인 채널 추적 방식)

  • Jeon, Hyoung-Goo;Kim, Kyoung-Soo;Ahn, Ji-Whan;Serpedin, Erchin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3A
    • /
    • pp.256-268
    • /
    • 2008
  • This paper proposes an efficient scheme to track the time variant channel induced by multi-path Rayleigh fading in mobile wireless Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing (MIMO-OFDM) systems with null sub-carriers. In the proposed method, a blind channel response predictor is designed to cope with the time variant channel. The proposed channel tracking scheme consists of a frequency domain estimation approach that is coupled with a Minimum Mean Square Error (MMSE) time domain estimation method, and does not require any matrix inverse calculation during each OFDM symbol. The main attributes of the proposed scheme are its reduced computational complexity and good tracking performance of channel variations. The simulation results show that the proposed method exhibits superior performance than the conventional channel tracking method [4] in time varying channel environments. At a Doppler frequency of 100Hz and bit error rates (BER) of 10-4, signal-to-noise power ratio (Eb/N0) gains of about 2.5dB are achieved relative to the conventional channel tracking method [4]. At a Doppler frequency of 200Hz, the performance difference between the proposed method and conventional one becomes much larger.

Wideband Jamming Signal Remove Using Adaptive Array Algorithm (적응배열 알고리즘을 이용한 광대역 재밍 신호 제거)

  • Lee, Kwan-Hyeong
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.4
    • /
    • pp.419-424
    • /
    • 2019
  • In this paper, we proposed an algorithm to estimate the desired target in wideband jamming signal environment. In order to suppress the jamming signal, we use the spatial time adaptive algorithm and QR decomposition to obtain the optimal weight. The spatial time adaptive algorithm of adaptive array antenna system multiplies the tap delay signal by a complex weight to obtain a weight. In order to minimize the power consumption because of the inverse matrix, optimal weight is obtained by using QR decomposition. Through simulation, we compare and analyze the performance of the proposed algorithm and the existing algorithm. In the target estimation of [-40o,0o,+40o], the proposed algorithm estimated all three targets, but the existing algorithm estimated only [0o] due to of the jamming signal. We prove that the proposed algorithm improves performance by removing the jamming signal and estimating the target accurately.

A study on robust recursive total least squares algorithm based on iterative Wiener filter method (반복형 위너 필터 방법에 기반한 재귀적 완전 최소 자승 알고리즘의 견실화 연구)

  • Lim, Jun Seok
    • The Journal of the Acoustical Society of Korea
    • /
    • v.40 no.3
    • /
    • pp.213-218
    • /
    • 2021
  • It is known that total least-squares method shows better estimation performance than least-squares method when noise is present at the input and output at the same time. When total least squares method is applied to data with time series characteristics, Recursive Total Least Squares (RTS) algorithm has been proposed to improve the real-time performance. However, RTLS has numerical instability in calculating the inverse matrix. In this paper, we propose an algorithm for reducing numerical instability as well as having similar convergence to RTLS. For this algorithm, we propose a new RTLS using Iterative Wiener Filter (IWF). Through the simulation, it is shown that the convergence of the proposed algorithm is similar to that of the RTLS, and the numerical robustness is superior to the RTLS.

Development of the Vibration Analysis Program Applying the High-Performance Numerical Analysis Library (고성능 수치해석 라이브러리를 적용한 진동해석 프로그램 개발)

  • Ko, Dou-Hyun;Boo, Seung-Hwan
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.27 no.1
    • /
    • pp.201-209
    • /
    • 2021
  • In order to evaluate the vibrational characteristics of huge finite element models such as ships and offshore structures, it is essential to perform eigenvalue analysis and frequency response analysis. However, these analyzes necessitate excessive equipment and computation time, which require the development of a high-performance analysis program. In particular, a considerable computational analysis time is required when calculating the inverse matrix in a linear system of equations and analyzing the eigenvalue analysis. Therefore, it can be improved by applying the latest high-performance library. In this paper, the vibration analysis program that enables fast and accurate analysis was developed by applying 'PARDISO', a parallel linear system of equation calculation library, and 'ARPACK', a high-performance eigenvalue analysis library. To verify the accuracy and efficiency of proposed method, we compare ABAQUS with proposed program using numerical examples of marine engineering.

Low-complexity Sensor Selection Based on QR factorization (QR 분해에 기반한 저 복잡도 센서 선택 알고리즘)

  • Yoon Hak, Kim
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.27 no.1
    • /
    • pp.103-108
    • /
    • 2023
  • We study the problem of selecting a subset of sensor nodes in sensor networks in order to maximize the performance of parameter estimation. To achieve a low-complexity sensor selection algorithm, we propose a greedy iterative algorithm that allows us to select one sensor node at a time so as to maximize the log-determinant of the inverse of the estimation error covariance matrix without resort to direct minimization of the estimation error. We apply QR factorization to the observation matrix in the log-determinant to derive an analytic selection rule which enables a fast selection of the next node at each iteration. We conduct the extensive experiments to show that the proposed algorithm offers a competitive performance in terms of estimation performance and complexity as compared with previous sensor selection techniques and provides a practical solution to the selection problem for various network applications.

An Efficient Post-Quantum Signature Scheme Based on Multivariate-Quadratic Equations with Shorter Secret Keys (양자컴퓨터에 안전한 짧은 비밀키를 갖는 효율적인 다변수 이차식 기반 전자서명 알고리즘 설계)

  • Kyung-Ah Shim
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.2
    • /
    • pp.211-222
    • /
    • 2023
  • Multivariate quadratic equations (MQ)-based public-key cryptographic algorithms are one of promising post-quantumreplacements for currently used public-key cryptography. After selecting to NIST Post-Quantum Cryptography StandardizationRound 3 as one of digital signature finalists, Rainbow was cryptanalyzed by advanced algebraic attacks due to its multiple layered structure. The researches on MQ-based schemes are focusing on UOV with a single layer. In this paper, we propose a new MQ-signature scheme based on UOV using the combinations of the special structure of linear equations, spare polynomials and random polynomials to reduce the secret key size. Our scheme uses the block inversion method using half-sized blockmatrices to improve signing performance. We then provide security analysis, suggest secure parameters at three security levels and investigate their key sizes and signature sizes. Our scheme has the shortest signature length among post-quantumsignature schemes based on other hard problems and its secret key size is reduced by up to 97% compared to UOV.

DSP Implementation of The Position Location System in Underwater Channel Environments (수중환경에서 위치추적 시스템의 DSP 구현)

  • Ko, Hak-Lim;Lim, Yong-Kon;Lee, Deok-Hwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.26 no.1
    • /
    • pp.48-54
    • /
    • 2007
  • In this paper we have implemented a 3-D PL (Position Location) system to estimate the 3-dimensional position of a moving object in underwater environments. In this research, we let four sensors fixed in different Positions and moving sensorsto communicate with each other to find the 3-dementianal positions for both the fixed and moving objects. Using this we were also able to control the moving object remotely. When finding the position, we calculated the norm of the Jacobian matrix every iteration in the Newton algorithm. Also by using a different initial value for calculating the solution when the norm became higher than the critical value and the solution from the inverse matrix became unstable, we could find a more reliable position for the moving object. The proposed algorithm was used in implementing a DSP system capable of real-time position location. To verify the performance, experiments were done in a water tank. As a result we could see that our system could located the position of an object every 2 seconds with a error range of 5cm.