• Title/Summary/Keyword: Switching algorithm

Search Result 1,005, Processing Time 0.171 seconds

Scan Cell Grouping Algorithm for Low Power Design

  • Kim, In-Soo;Min, Hyoung-Bok
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.1
    • /
    • pp.130-134
    • /
    • 2008
  • The increasing size of very large scale integration (VLSI) circuits, high transistor density, and popularity of low-power circuit and system design are making the minimization of power dissipation an important issue in VLSI design. Test Power dissipation is exceedingly high in scan based environments wherein scan chain transitions during the shift of test data further reflect into significant levels of circuit switching unnecessarily. Scan chain or cell modification lead to reduced dissipations of power. The ETC algorithm of previous work has weak points. Taking all of this into account, we therefore propose a new algorithm. Its name is RE_ETC. The proposed modifications in the scan chain consist of Exclusive-OR gate insertion and scan cell reordering, leading to significant power reductions with absolutely no area or performance penalty whatsoever. Experimental results confirm the considerable reductions in scan chain transitions. We show that modified scan cell has the improvement of test efficiency and power dissipations.

THE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX

  • LEE, JAEJIN
    • Korean Journal of Mathematics
    • /
    • v.23 no.3
    • /
    • pp.427-438
    • /
    • 2015
  • The Schensted algorithm first described by Robinson [5] is a remarkable combinatorial correspondence associated with the theory of symmetric functions. $Sch{\ddot{u}}tzenberger's$ jeu de taquin[10] can be used to give alternative descriptions of both P- and Q-tableaux of the Schensted algorithm as well as the ordinary and dual Knuth relations. In this paper we describe the jeu de taquin on shifted rim hook tableaux using the switching rule, which shows that the sum of the weights of the shifted rim hook tableaux of a given shape and content does not depend on the order of the content if content parts are all odd.

Loss Minimization for Distribution Network using Partial Tree Search (부분 tree 탐색을 이용한 배전계통의 손실 최소화)

  • Choi, S.Y.;Shin, M.C.;Nam, G.Y.;Cho, P.H.;Park, J.S.
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.519-521
    • /
    • 2000
  • Network reconfiguration is an operation task, and consists in the determination of the switching operations such to reach the minimum loss conditions of the distribution network. In this paper, an effective heuristic based switch scheme for loss minimization is given for the optimization of distribution loss reduction and a solution approach is presented. The solution algorithm for loss minimization has been developed based on the two stage solution methodology. The first stage of this solution algorithm sets up a decision tree which represent the various switching operations available, the second stage applies a proposed technique called cyclic best first search. Therefore, the solution algorithm of proposed method can determine on-off switch statuses for loss reduction, with a minimum computational effort.

  • PDF

Time-varying sliding surface design using eigenvalue locus for high-order variable structure control systems (고차 가변구조 제어 시스템에서의 고유치 궤적을 이용한 시변 스위칭 평면 설계)

  • 이영성;김가규;최봉열
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.253-256
    • /
    • 1996
  • In this paper, A new time-varying sliding surface design using eigenvalue locus is proposed to achieve fast and robust in a class of high-order uncertain dynamic system. A moving sliding surface(MSS) was proposed earlier for the second-order variable structure control systems(VSCS). This methodology led to fast and robust control responses of the second-order VSCS. However, the moving algorithm of the MSS was too complicated to be employed the high-order VSCS. To resolve this problem, we propose a new moving algorithm that switching surface moves such that the eigenvalues of equivalent system in the sliding mode have a predetermined locus. Using the proposed surface fast and robust behaviors are accomplished. The problem of chattering can be eliminated by using a boundary layer of switching surface. The efficiency of proposed algorithm is illustrated by an application to four-order workbench.

  • PDF

Initial Convergence Detection of Blind Equalization Algorithm Automatically (블라인드 등화 알고리즘의 초기 수렴 자동 검출 기법)

  • Choi, Ik-Hyun;Kim, Chul-Min;Choi, Soo-Chul;Oh, Kil-Nam
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.445-447
    • /
    • 2005
  • MCMA(modified constant modulus algorithm) accomplishes blind equalization and carrier phase recovery simultaneously. But, the error level of MCMA is not zero when the equalizer converges completely. Because the MCMA uses a special signal point instead of a original signal point. MCMA-DO(decision-directed) improves the steady-state performance but the performance of equalizer is decided by switching time between the MCMA and the DD. In this paper, according to the residual ISI(intersymbol interference) of the equalizer output, the most suitable switching time is decided automatically.

  • PDF

Quadruped Walking Control of DRC-HUBO (DRC 휴보의 4족 보행 제어)

  • Kim, Jung-Yup
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.24 no.5
    • /
    • pp.548-552
    • /
    • 2015
  • In this paper, we describe the quadruped walking-control algorithm of the complete full-size humanoid DARPA Robotics Challenge-HUBO (DRC-HUBO) robot. Although DRC-HUBO is a biped robot, we require a quadruped walking function using two legs and two arms to overcome uneven terrains in the DRC. We design a wave-type quadruped walking pattern as a feedforward control using several walking parameters, and we design zero moment point (ZMP) controllers to maintain stable walking using an inverted pendulum model and an observed-state feedback control scheme. In particular, we propose a switching algorithm for ZMP controllers using supporting value and weighting factors in order to maintain the ZMP control performance during foot switching. Finally, we verify the proposed algorithm by performing quadruped walking experiments using DRC-HUBO.

개폐식 밸브를 이용한 공압실린더의 위치제어

  • 홍지중;이정오;홍예선
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1992.04a
    • /
    • pp.380-384
    • /
    • 1992
  • The position control of a pneumatic cylinder suing low cost on-off valves is studied. The valve control band(VCB) was proposed toget fast response and toprevent solenoid valves from unnecessary switching at the beginning of response. A learning algorithm was used to compensate the nonlinearity and complexity in mathematical modelling of pheumatic on-off controlled positioning systems. In this algorithm, the desired performance index and modified learning rate, were proposed to improvespeed and convergence of learning control. It is shown experimentally that the proposed algorithm is robust to changes of system parameters: the setting time less than 1.0 sec and the error bound of .+-. 0.1 mm can be obtained. The effects of supply pressure, size of switching valves and the effect of multiple valves are discussed, and computer simulation onthe dynamic performances of the pneumatic system is also presented.

Improved MCMC Simulation for Low-Dimensional Multi-Modal Distributions

  • Ji, Hyunwoong;Lee, Jaewook;Kim, Namhyoung
    • Management Science and Financial Engineering
    • /
    • v.19 no.2
    • /
    • pp.49-53
    • /
    • 2013
  • A Markov-chain Monte Carlo sampling algorithm samples a new point around the latest sample due to the Markov property, which prevents it from sampling from multi-modal distributions since the corresponding chain often fails to search entire support of the target distribution. In this paper, to overcome this problem, mode switching scheme is applied to the conventional MCMC algorithms. The algorithm separates the reducible Markov chain into several mutually exclusive classes and use mode switching scheme to increase mixing rate. Simulation results are given to illustrate the algorithm with promising results.

A Diagnosis Scheme of Switching Devices under Open Fault in Inverter-Fed Interior Permanent Magnet Synchronous Motor Drive (매입형 영구자석 동기전동기 구동용 인버터 스위칭 소자의 개방 고장 진단)

  • Choi, Dong-Uk;Kim, Kyeong-Hwa
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.26 no.3
    • /
    • pp.61-68
    • /
    • 2012
  • This paper deals with a fault diagnosis algorithm for open faults in the switching devices of PWM inverter-fed IPMSM (Interior Permanent Magnet Synchronous Motor) drive. The proposed diagnostic algorithm is realized in the controller using the informations of three-phase currents or reference line-to-line voltages, without requiring additional equipments for fault detection. Under switch open fault conditions, the conventional dq model used to control an AC motor cannot directly be applied for the analysis of drive system, since three-phase balanced condition does not hold. To overcome this limitation, a fault model based on the line-to-line voltages is employed for the simulation studies. For comparative performance evaluation through the experiments, the entire control system is implemented using digital signal processor (DSP) TMS320F28335. Simulations and experimental results are presented to verify the validity of the proposed diagnosis algorithm.

Loss Reduction in Heavy Loaded Distribution Networks Using Cyclic Sub Tree Search (순환적 부분트리 탐색법을 이용한 중부하 배전계통의 손실최소화)

  • Choi, Sang-Yule;Shin, Myong-Chul
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.5
    • /
    • pp.241-247
    • /
    • 2001
  • Network reconfiguration in distribution systems is realized by changing the status of sectionalizing switches, and is usually done for loss reduction of load balancing in the system. This paper presents an effective heuristic based switching scheme to solve the distribution feeder loss reduction problem. The proposed algorithm consists of two parts. One is to set up a decision tree to represent the various switching operations available. Another is to apply a proposed technique called cyclic best first search. the proposed algorithm identify the most effective the set of switch status configuration of distribution system for loss reduction. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the 32, 69 bus system models.

  • PDF