• Title/Summary/Keyword: Calculation algorithms

Search Result 471, Processing Time 0.023 seconds

Development of Human Driver Model based on Neuromuscular System for Evaluation of Electric Power Steering System (전동식 조향 장치의 성능 평가를 위한 신경 근육계 기반 운전자 모델 개발)

  • Lee, Sunghyun;Lee, Dongpil;Lee, Jaepoong;Chae, Heungseok;Lee, Myungsu;Yi, Kyongsu
    • Journal of Auto-vehicle Safety Association
    • /
    • v.9 no.3
    • /
    • pp.19-23
    • /
    • 2017
  • This paper presents a lateral driver model with neuromuscular system to evaluate the performance of electric power steering (EPS). Output of most previously developed driver models is steering angle. However, in order to evaluate EPS system, driver model which results in steering torque output is needed. The proposed lateral driver model mainly consists of 2 parts: desired steering angle calculation and conversion of steering angle into steering torque. Desired steering angle calculation part results in steering angle to track desired yaw rate for path tracking. Conversion of steering angle into torque is consideration with neuromuscular system. The proposed driver model is investigated via actual driving data. Compared to other algorithms, the proposed algorithm shows similar pattern of steering angle with human driver. The proposed driver can be utilized to efficiently evaluate EPS system in simulation level.

A Novel Position Sensorless Speed Control Scheme for Permanent Magnet Synchronous Motor Drives

  • Won, Tae-Hyun;Lee, Man-Hyung
    • KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
    • /
    • v.2B no.3
    • /
    • pp.125-132
    • /
    • 2002
  • PMSMS (permanent magnet synchronous motors) are widely used in industrial applications and home appliances because of their high torque to inertia ratio, superior power density, and high efficiency. For high performance control, accurate informations about the rotor position is essential. Sensorless algorithms have lately been studied extensively due to the high cost of position sensors and their low reliability in harsh environments. A novel position sensorless speed control for PMSMs uses indirect flux estimation and is presented in this paper. Rotor position and angular velocity are estimated by the proposed indirect flux estimation. Linkage flux and magnetic field flux are calculated by the voltage equations and the measured phase current without any integration. Instead of linkage flux calculation with integral operation, indirect flux and differential magnetic field are used for the estimation of rotor position. A proper rejection technique fur current noise effect in the calculation of differential linkage flux is introduced. The proposed indirect flux detecting method is free from the integral rounding error and linkage flux drift problem, because differential linkage flux can be calculated without any integral operation. Furthermore, electrical parameters of the PMSM can be measured by the proposed TCM (time compression method) for soft starting and precise estimation of rotor position. The position estimator uses accurate electrical parameters that are obtained from the proposed TCM at starting strategy. In the operating region, a proper compensation method fur temperature effect can compensate fir the estimation error from the variation of electrical parameters. The proposed novel position sensorless speed control scheme is verified by the experimental results.

Numerical Simulation of Impact and Dynamic Deformation Based on Two-Step Eulerian Method (Two-Step Eulerian 기법 기반 충돌 및 동적 변형 해석)

  • 백승훈;이민형;김승조
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.34 no.8
    • /
    • pp.47-54
    • /
    • 2006
  • In this paper, numerical algorithms applied in two-step eulerian scheme are investigated and implemented. Element quantities are advected with donor or van Leer algorithm. Nodal quantities are advected with Simplifed ALE [SALE] algorithm. Material interfaces are determined with Simple Line Interface Calculation [SLIC] algorithm. Practical aspects considered for code development are addressed in detail. The results of developed two-step Eulerian code are verified by comparing with those from pure lagrangian scheme and commercial code.

3D traveltime calculation considering seismic velocity anisotropy (탄성파 속도 이방성을 고려한 3차원 주시 모델링)

  • Jeong, Chang-Ho;Suh, Jung-Hee
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.203-208
    • /
    • 2007
  • Due to the long tectonic history and the very complex geologic formations in Korea, the anisotropic characteristics of subsurface material may often change very greatly and locally. The algorithms for the travel time computation commonly used, however, may not give sufficiently precise results particularly for the complex and strong anisotropic model, since they are based on the two-dimensional (2D) earth and/or weak anisotropy assumptions. This study is intended to develope a three-dimensional (3D) modeling algorithm to precisely calculate the first arrival time in the complex anisotropic media. We assume 3D TTI (tilted transversely isotropy) medium having the arbitrary symmetry axis. The algorithm includes the 2D non-linear interpolation scheme to calculate the traveltimes inside the grid and the 3D traveltime mapping to fill the 3D model with first arrival times. The weak anisotropy assumption, moreover, can be overcome through devising a numerical approach of the steepest descent method in the calculation of minimum traveltime, instead of using approximate solution.

  • PDF

Shortest Path Calculation Using Parallel Processor System (병력구조 전산기를 이용한 최단 경로 계산)

  • 서창진;이장규
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.34 no.6
    • /
    • pp.230-237
    • /
    • 1985
  • Shortest path calculations for a large-scale network have to be performed using a decomposition techniqre, since the calculations require large memory size which increases by the square of the number of vertices in the network. Also, the calculation time increases by the cube of the number of vertices in the network. In the decomposition technique,the network is broken into a number of smaller size subnetworks for each of which shortest paths are computed. A union of the solutions provides the solution of the original network. In all of the decomposition algirithms developed up to now, boundary vertices which divide all the subnetworks have to be included in computing shortest paths for each subnetwork. In this paper, an improved algorithm is developed to reduce the number of boundary vertices to be engaged. In the algorithm, only those boundary vertices that are directly connected to the subnetwork are engaged. The algorithm is suitable for an application to real time computation using a parallel processor system which consists of a number of micro-computers or prcessors. The algorithm has been applied to a 39- vertex network and a 232-vertex network. The results show that it is efficient and has better performance than any other algorithms. A parallel processor system has been built employing an MZ-80 micro-computer and two Z-80 microprocessor kits. The former is used as a master processor and the latter as slave processors. The algorithm is embedded into the system and proven effective for real-time shortest path computations.

  • PDF

Efficient Adaptive Algorithms Based on Zero-Error Probability Maximization (영확률 최대화에 근거한 효율적인 적응 알고리듬)

  • Kim, Namyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.5
    • /
    • pp.237-243
    • /
    • 2014
  • In this paper, a calculation-efficient method for weight update in the algorithm based on maximization of the zero-error probability (MZEP) is proposed. This method is to utilize the current slope value in calculation of the next slope value, replacing the block processing that requires a summation operation in a sample time period. The simulation results shows that the proposed method yields the same performance as the original MZEP algorithm while significantly reducing the computational time and complexity with no need for a buffer for error samples. Also the proposed algorithm produces faster convergence speed than the algorithm that is based on the error-entropy minimization.

Material Design Using Multi-physics Simulation: Theory and Methodology (다중물리 전산모사를 이용한 물성 최적화 이론 및 시뮬레이션)

  • Hyun, Sangil
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.27 no.12
    • /
    • pp.767-775
    • /
    • 2014
  • New material design has obtained tremendous attention in material science community as the performance of new materials, especially in nano length scale, could be greatly improved to applied in modern industry. In certain conditions limiting experimental synthesis of these new materials, new approach by computer simulation has been proposed to be applied, being able to save time and cost. Recent development of computer systems with high speed, large memory, and parallel algorithms enables to analyze individual atoms using first principle calculation to predict quantum phenomena. Beyond the quantum level calculations, mesoscopic scale and continuum limit can be addressed either individually or together as a multi-scale approach. In this article, we introduced current endeavors on material design using analytical theory and computer simulations in multi-length scales and on multi-physical properties. Some of the physical phenomena was shown to be interconnected via a cross-link rule called 'cross-property relation'. It is suggested that the computer simulation approach by multi-physics analysis can be efficiently applied to design new materials for multi-functional characteristics.

Responsiveness-Enhancing Scheme for ABR Rate Control Algorithms in Wireless ATM Networks (무선 ATM 망에서의 ABR 전송률 제어 알고리즘 응답성 개선 방안)

  • Min, Koo;Choi, Myung-Whan
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.3
    • /
    • pp.370-380
    • /
    • 2000
  • Asynchronous Transfer Model(ATM)에 기반한 광대역 멀티미디어 통신망에서 best effort 형태의 서비스 지원을 위해 Available Bit Rate(ABR) 서비스가 사용되고 있다. 이미 제안된 많은 수의 ABR 전송률제어 알고리즘들은 정확하게 적정전송률을 계산하는 알고리즘(exact fair rate calculation algorithm)과 적정전송률의 근사치를 계산하는 알고리즘(approximate fair rate calculation algorithm)의 두 분류로 크게 구분 될 수 있다. 정확하게 적정전송률을 계산하는 알고리즘은 공정성과 응답성(responsiveness)측면에서 장점을 갖는다. 하지만 무선ATM 환경 하에서는 무선링크의 가용대역폭이 무선채널의 오류특성으로 인해 시변(time-varying)하므로, 정확하게 적정전송률을 계산하는 알고리즘은 무선ATM 환경에 적용되기 어려우며 따라서 적정전송률의 근사치를 계산하는 알고리즘이 대산 사용될 수 있다. 이 경우에 적정전송률의 근사치를 계산하는 알고리즘들의 응답성이 상대적으로 뒤떨어지는 특성으로 인해 가용대역폭이 시변하는 경우 알고리즘 성능의 저하가 발생될 수 있다. 본 논문에서는 적정전송률의 근사치를 계산하는 알고리즘들을 위한 응답성 개선 방안을 제안하고 응답성이 개선된 적정전송률의 근사치를 계산하는 알고리즘의 한 예로 응답성이 개선된 EDMRCA 알고리즘을 제시한다. 모의 실험을 통해 제시하는 알고리즘이 EDMRCA보다 응답성 측면에서 상당히 개선되었음을 보인다.

  • PDF

A Fast IFFT Algorithm for IMDCT of AAC Decoder (AAC 디코더의 IMDCT를 위한 고속 IFFT 알고리즘)

  • Chi, Hua-Jun;Kim, Tae-Hoon;Park, Ju-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.26 no.5
    • /
    • pp.214-219
    • /
    • 2007
  • This paper proposes a new IFFT(Inverse Fast Fourier Transform) algorithm, which is proper for IMDCT(Inverse Modified Discrete Cosine Transform) of MPEG-2 AAC(Advanced Audio Coding) decoder. The $2^n$(N-point) type IMDCT is the most powerful among many IMDCT algorithms, however it includes IFFT that requires many calculation cycles. The IFFT used in $2^n$(N-point) type IMDCT employ the bit-reverse data arrangement of inputs and N/4-point complex IFFT to reduce the calculation cycles. We devised a new data arrangement method of IFFT input and $N/4^{n+1}$-type IFFT and thus we can reduce multiplication cycles, addition cycles, and ROM size.

Novel Compressed Sensing Techniques for Realistic Image (실감 영상을 위한 압축 센싱 기법)

  • Lee, Sun Yui;Jung, Kuk Hyun;Kim, Jin Young;Park, Gooman
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.3
    • /
    • pp.59-63
    • /
    • 2014
  • This paper describes the basic principles of 3D broadcast system and proposes new 3D broadcast technology that reduces the amount of data by applying CS(Compressed Sensing). Differences between Sampling theory and the CS technology concept were described. Recently proposed CS algorithm AMP(Approximate Message Passing) and CoSaMP(Compressive Sampling Matched Pursuit) were described. This paper compared an accuracy between two algorithms and a calculation time that image data compressed and restored by these algorithms. As result determines a low complexity algorithm for 3D broadcast system.