• Title/Summary/Keyword: implementation algorithm

Search Result 4,233, Processing Time 0.03 seconds

Sensorless Control Using the Back EMF of PM Generator for 2MW Variable Speed Wind Turbine (역기전력을 이용한 2MW급 가변속 풍력터빈용 영구자석 동기기의 센서리스 제어)

  • Im, Ji-Hoon;Oh, Sang-Geun;Song, Seung-Ho;Lee, Hyen-Young;Kwon, Oh-Jeong;Jang, Jeong-Ik;Lee, Kwon-Hee
    • Journal of Wind Energy
    • /
    • v.2 no.2
    • /
    • pp.54-60
    • /
    • 2011
  • A PMSG in variable speed wind turbine needs to know the position of rotor for vector control. Since the position sensor has the disadvantage in terms of cost, complexity of the system, a sensorless algorithm is needed. The sensorless strategy using the back EMF estimation is used for PMSG Wind Turbine. This algorithm is comparatively easy to implement than other strategies. This paper introduces the application of stable sensorless control for 2MW direct drive PMSG. In order to confirm the sensorless algorithm, the implementation is proceeded using 2MW direct drive PMSG from no-load condition to full-load condition. To drive 2MW PMSG artificially, 2MW PMSG connected PMSG through the mechanical coupling.

Polynomial-Filled Function Algorithm for Unconstrained Global Optimization Problems

  • Salmah;Ridwan Pandiya
    • Kyungpook Mathematical Journal
    • /
    • v.64 no.1
    • /
    • pp.95-111
    • /
    • 2024
  • The filled function method is useful in solving unconstrained global optimization problems. However, depending on the type of function, and parameters used, there are limitations that cause difficultiies in implemenations. Exponential and logarithmic functions lead to the overflow effect, requiring iterative adjustment of the parameters. This paper proposes a polynomial-filled function that has a general form, is non-exponential, nonlogarithmic, non-parameteric, and continuously differentiable. With this newly proposed filled function, the aforementioned shortcomings of the filled function method can be overcome. To confirm the superiority of the proposed filled function algorithm, we apply it to a set of unconstrained global optimization problems. The data derived by numerical implementation shows that the proposed filled function can be used as an alternative algorithm when solving unconstrained global optimization problems.

Design of Omok AI using Genetic Algorithm and Game Trees and Their Parallel Processing on the GPU (유전 알고리즘과 게임 트리를 병합한 오목 인공지능 설계 및 GPU 기반 병렬 처리 기법)

  • Ahn, Il-Jun;Park, In-Kyu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.2
    • /
    • pp.66-75
    • /
    • 2010
  • This paper proposes an efficient method for design and implementation of the artificial intelligence (AI) of 'omok' game on the GPU. The proposed AI is designed on a cooperative structure using min-max game tree and genetic algorithm. Since the evaluation function needs intensive computation but is independently performed on a lot of candidates in the solution space, it is computed on the GPU in a massive parallel way. The implementation on NVIDIA CUDA and the experimental results show that it outperforms significantly over the CPU, in which parallel game tree and genetic algorithm on the GPU runs more than 400 times and 300 times faster than on the CPU. In the proposed cooperative AI, selective search using genetic algorithm is performed subsequently after the full search using game tree to search the solution space more efficiently as well as to avoid the thread overflow. Experimental results show that the proposed algorithm enhances the AI significantly and makes it run within the time limit given by the game's rule.

A Gait Implementation of a Biped Robot Based on Intelligent Algorithm (지능 알고리즘 기반의 이족 보행로봇의 보행 구현)

  • Kang Chan-Soo;Kim Jin-Geol;Noh Kyung-Kon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.12
    • /
    • pp.1210-1216
    • /
    • 2004
  • This paper deals with a human-like gait generation of a biped robot with a balancing weight of an inverted pendulum type by using genetic algorithm. The ZMP (Zero Moment Point) is the most important index in a biped robot's dynamic walking stability. To perform a stable walking of a biped robot, a balancing motion is required according to legs' trajectories and a desired ZMP trajectory. A dynamic equation of the balancing motion is nonlinear due to an inverted pendulum type's balancing weight. To solve the nonlinear equation by the FDM (Finite Difference Method), a linearized model of equation is proposed. And GA (Genetic Algorithm) is applied to optimize a human-like balancing motion of a biped robot. By genetic algorithm, the index of the balancing motion is efficiently optimized, and a dynamic walking stability is verified by the ZMP verification equation. These balancing motion are simulated and experimented with a real biped robot IWR-IV. This human-like gait generation will be applied to a humanoid robot, at future work.

Implementation of MDCT core in Digital-Audio with Micro-program type vector processor

  • Ku Dae Sung;Choi Hyun Yong;Ra Kyung Tae;Hwang Jung Yeun;Kim Jong Bin
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.477-481
    • /
    • 2004
  • High Quality CD, OAT audio requires that large amount of data. Currently, multi channel preference has been rapidly propagated among latest users. The MPEG(Moving Picture Expert Group) is provides data compression technology of sound and image system. The MPEG standard provides multi channel and 5.1 sounds, using the same audio algorithm as MPEG-l. And MPEG-2 audio is forward and backward compatible. The MDCT (Modified Discrete Cosine Transform) is a linear orthogonal lapped transform based on the idea of TDAC(Time Domain Aliasing Cancellation). In this paper, we proposed the micro-program type vector processor architecture a benefit in MDCT/IMDCT of MPEG-II AAC. And it's reduced operating coefficient by overlapped area to bind. To compare original algorithm with optimized algorithm that cosine coefficient reduced $0.5\%$multiply operating $0.098\%$ and add operating 80.58\%$. Algorithm test is used C-language then we designed hardware architecture of micro-programmed method that applied to optimized algorithm. This processor is 20MHz operation 5V.

  • PDF

Design, Development and Analysis of Embedded Systems for Condition Monitoring of Rotating Machines using FFT Algorithm

  • Dessai, Sanket;Naaz, Zakiyaunnissa Alias Naziya
    • Journal of international Conference on Electrical Machines and Systems
    • /
    • v.3 no.4
    • /
    • pp.428-432
    • /
    • 2014
  • Rotating machines are an integral part of large electrical power machinery in most of the industries. Any degradation or outages in the rotating electric machinery can result in significant losses in productivity. It is critical to monitor the equipment for any degradation's so that it can serve as an early warning for adequate maintenance activities and repair. Prior research and field studies have indicated that the rotating machines have a particular type of signal structure during the initial start-up transient. A machine performance can be studied based on the effect of degradation in signal parameters. In this paper a data-acquisition system and the FFT algorithm has been design and model using the MATLAB and Simulink. The implementation had been carried out on the TMS320 DSP Processor and various testing and verification of the machine performance had been carried out. The results show good agreement with expected results for both simulated and real-time data. The real-time data from AC water pumps which have rotating motors built-in were collected and analysed. The FFT algorithm provides frequency response and based on this frequency response performance of the machine had been measured.The FFT algorithm provides only approximation about the machine performances.

The Proposal of Segmentation Algorithm for the Applying Breast Ultrasound Image to CAD (유방 초음파 영상의 CAD 적용을 위한 Segmentation 알고리즘 제안)

  • Koo, Lock-Jo;Jung, In-Sung;Bea, Jea-Ho;Choi, Sung-Wook;Park, Hee-Boong;Wang, Gi-Nam
    • IE interfaces
    • /
    • v.21 no.4
    • /
    • pp.394-402
    • /
    • 2008
  • The objective of this paper is to design segmentation algorithm for applying the breast ultrasound image to CAD(Computer Aided Diagnosis). This study is conducted after understanding limits, used algorithm and demands of CAD system by interviewing with a medical doctor and analyzing related works based on a general CAD framework that is consisted of five step-establishment of plan, analysis of needs, design, implementation and test & maintenance. Detection function of CAD is accomplished by Canny algorithm and arithmetic operations for segmentation. In addition to, long computing time is solved by extracting ROI (Region Of Interests) and applying segmentation technical methods based morphology algorithm. Overall course of study is conducted by verification of medical doctor. And validity and verification are satisfied by medical doctor's confirmation. Moreover, manual segmentation of related works, restrictions on the number of tumor and dependency of image resolution etc. was solved. This study is utilized as a support system aided doctors' subjective diagnosis even though a lot of future studies is needed for entire application of CAD system.

An Implementation of an SHA-3 Hash Function Validation Program and Hash Algorithm on 16bit-UICC (SHA-3 해시 함수 검정 프로그램과 16bit-UICC 용 SHA-3 구현)

  • Lee, Hee-Woong;Hong, Dowon;Kim, Hyun-Il;Seo, ChangHo;Park, Kishik
    • Journal of KIISE
    • /
    • v.41 no.11
    • /
    • pp.885-891
    • /
    • 2014
  • A hash function is an essential cryptographic algorithm primitive that is used to provide integrity to many applications such as message authentication codes and digital signatures. In this paper, we introduce a concept and test method for a Cryptographic Algorithm Validation Program (CAVP). Also, we design an SHA-3 CAVP program and implement an SHA-3 algorithm in 16bit-UICC. Finally, we compare the efficiency of SHA-3 with SHA-2 and evaluate the exellence of the SHA-3 algorithm.

Optimal Quantization Bits Decision of Soft-Decision BCH Codes for DVB-RCS NG Systems (DVB-RCS NG 시스템을 위한 연판정 e-BCH 부호의 구현을 위한 최적 양자화 비트 수 결정)

  • Kim, Min-Hyuk;Park, Tae-Doo;Lim, Byeong-Su;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.9
    • /
    • pp.1895-1902
    • /
    • 2011
  • The soft-decision e-BCH decoding algorithm based on the Chase algorithm is adopted in DVB-RCS NG systems. For implementation, it is necessary to decide the number of optimal quantization bits when soft-decision e-BCH decoding algorithm is processed. Also, the performance must be satisfied. Therefore, in this paper, when the soft-decision e-BCH decoder is implemented, we select the number of optimal quantization bits using BER performance.

조선 도장 공장 운영 방안 수립에 관한 연구

  • 최동희;박주철
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.286-289
    • /
    • 2001
  • This paper deals with the procedures of effective mid-term Operation Planning establishment for painting shop in shipbuilding. and develop prototype system. In general, the block painting process consists of two stages such as blasting operation for surface preparation and painting operation for paint application for blocks. Weather condition is a potent Influence on those operations. The procedures consists of four steps, Load analysis, Generate alternative simulation plan. Implementation of Allocation automation module and Compare result of each simulation plan. Explain of each step. as follows, 1.step, Load analysis measure amount of assigned workload and manhour. 2.step, simulation scheme include alterable control variable such as overtime, weather. Auto allocating module carry out feasibility of simulation plan. 3.step, Allocation automation module are composed of three algorithms, as followings: - the block allocation algorithm that determines the number of blocks to be processed each day, - the team allocation algorithm that allocates blocks to worker groups. - the block arrangement algorithm that arrange blocks in blasting and painting cells. Since the block arrangement algorithm is conducted simultaneously with the team allocation algorithm, the total structure of the operating algorithms is considered to have two phases: first, daily load balancing with capacity limit and second, team allocation considering arrangement each day 4 step, Comparing result of each simulation plan. and select best simulation plan.

  • PDF