• Title/Summary/Keyword: Transition Reduction Algorithm

Search Result 28, Processing Time 0.023 seconds

A low power state assignment algorithm for asynchronous circuits using a state transistion probability (상태천이확률을 이용한 비동기회로의 저전력 상태할당 알고리즘)

  • 구경회;조경록
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.12
    • /
    • pp.1-8
    • /
    • 1997
  • In this paper, a new method of state code assignment for reduction of switching activities of state transition in asynchronous circuits is proposed. The algorithm is based on a on-hot code and modifies it to reduce switching activities. To estimate switching activities as a cost functions we introduce state transition probability (STP). AS a results, the proposed algorithm has an advantage of 60% over with the conventional code assignment in terms of switching and code length of state assignment.

  • PDF

A Proposal of State Reduction Algorithm and the Development of a Graphic Editor for State Machine Synthesizer (상태합성기 설계를 위한 상태축소 알고리듬 제안 및 그래픽 에디터 개발에 관한 연구)

  • 이근만;임인칠
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.4
    • /
    • pp.415-423
    • /
    • 1992
  • In this paper, we developed a Graphic Editor which automatically translated the state transition graph into state CHDL. Also, an algorithm for efficient state minimization is presented to reduce the redundancy state transition table.

  • PDF

Noise Reduction Algorithm of Digital Hologram Using Histogram Changing Method (히스토그램 변환기법을 이용한 디지털 홀로그램의 잡음제거 알고리듬)

  • Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.4
    • /
    • pp.603-610
    • /
    • 2008
  • In this paper, we propose an efficient noise reduction algorithm for digital hologram during acquisition and transmission. The proposed algorithm segment a digital hologram with object region and background region after DCT. Then, we adopt a histogram transition method for object region and zero-value change method for background region. The experimental results show that our algorithm has beuer performance than a natural image denoising algorithm.

A Study on Design of Posture Transition Filter for 3D Human Posture Estimation and Refinement on Robotic Bed (침대 로봇의 3차원 자세 추정 및 개선을 위한 자세 천이 필터 설계 연구)

  • Lee, Jong-il;Han, Jong-Boo;Koo, Jae Wan;Choi, Jae-Won;Hahm, Jehun;Yang, Kyon-Mo;Sohn, Dong-Seop;Seo, Kap-Ho
    • The Journal of Korea Robotics Society
    • /
    • v.15 no.3
    • /
    • pp.269-276
    • /
    • 2020
  • As we become an aging society, the number of elderly patients continues to increase. Pressure sores that can easily occur in patients with trauma cause serious socio-economic problems. In general, prevention of bedsores through predicting the patient's posture is being developed. Developed method usually use artificial intelligence techniques to estimate the patient's posture by measured pressure images in the mattress. In this method, it has a problem the reduction of estimation accuracy when posture of patient is changed. Therefore, it is necessary to use the filter of pressure images in the position transition of patient. In this paper, we propose an algorithm to predict the patient's posture, and an algorithm to reduce the ambiguity that can occur in the patient's posture transition section. By obtaining stable data through this algorithm, learning/prediction stability of the neural network can be expected, and prediction performance is improved accordingly. Through experiments, the effectiveness of the algorithm was verified.

A Transition Reduction Algorithm of Finite State Machines using Slice Models (Slice 모델을 이용한 유한상태머신의 트랜지션 축약 알고리즘)

  • Lee, Woo-Jin
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.1
    • /
    • pp.12-21
    • /
    • 2008
  • As the usage of computer systems is increasing in our lives, the reliability and safely of these systems need to be thoroughly checked through the verification techniques. As a basic formalism for several modeling methods, the finite state machine (FSM) is widely used in specification and verification of system models. And there is a technique for ing internal events of FSM in order to effectively analyze the system. However, this technique does not handle the state explosion problem since it can be applied after completely generating all the state space of the system. In this research, we provide a new approach for efficiently representing concurrent properties of FSM, the slice model and provide an efficient transition reduction method based on the slice model. Our approach is effective in time and space perspective since it is peformed by partially generating the needed system states while the existing abstraction technique can be applied to all the system states.

Voltage Selection Methodology for DVFS Overhead Minimization (동적 전압 주파수 스케일링 오버헤드 최소화를 위한 전압 선택 방법론)

  • Chang, Jin Kyu;Han, Tae Hee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.854-857
    • /
    • 2015
  • As the number of devices integrated on system-on-chip(SoC) increases exponentially, energy reduction technology is essential. Dynamic Voltage and Frequency Scaling (DVFS) is a very effective technique for reducing power consumption. Since it requires complex voltage regulators and PLL circuits, DVFS tends to have significant overheads. In this paper, we propose a new voltage selection algorithm to minimize transition overhead for multiprocessor SoC (MPSoC). Simulation results show that proposed algorithm appears less energy consumption with transition overhead even though maintains performance.

  • PDF

A Method of Interna State reduction in the Synthesis of Multipul-Input asynchronous Sequential circuits Using Transition-Sensitive Flip-Fops (다입력변화 천이응동비동기순서논리회로의 내부상태 감소법에 관한 연구)

  • 임재탁;이근영
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.11 no.2
    • /
    • pp.22-26
    • /
    • 1974
  • To synthesize transition-sensitive asynchronous sequential circuits, D-type transition-sensitive flip-flop is used.4 new concept, a pair of input state is introduced and used to reduce the number of internal states. We proposed an algorithm to synthesize multiple-input change asynchronous sequential circuits directly from a primitive state table an6 demonstrated the method is better than the one which is due to Bredeson and Hulina and Others.

  • PDF

Uniform Posture Map Algorithm to Generate Natural Motion Transitions in Real-time (자연스러운 실시간 동작 전이 생성을 위한 균등 자세 지도 알고리즘)

  • Lee, Bum-Ro;Chung, Chin-Hyun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.6
    • /
    • pp.549-558
    • /
    • 2001
  • It is important to reuse existing motion capture data for reduction of the animation producing cost as well as efficiency of producing process. Because its motion curve has no control point, however, it is difficult to modify the captured data interactively. The motion transition is a useful method to reuse the existing motion data. It generates a seamless intermediate motion with two short motion sequences. In this paper, Uniform Posture Map (UPM) algorithm is proposed to perform the motion transition. Since the UPM is organized through quantization of various postures with an unsupervised learning algorithm, it places the output neurons with similar posture in adjacent position. Using this property, an intermediate posture of two active postures is generated; the generating posture is used as a key-frame to make an interpolating motion. The UPM algorithm needs much less computational cost, in comparison with other motion transition algorithms. It provides a control parameter; an animator could control the motion simply by adjusting the parameter. These merits of the UPM make an animator to produce the animation interactively. The UPM algorithm prevents from generating an unreal posture in learning phase. It not only makes more realistic motion curves, but also contributes to making more natural motions. The motion transition algorithm proposed in this paper could be applied to the various fields such as real time 3D games, virtual reality applications, web 3D applications, and etc.

  • PDF

A fast block-matching algorithm using the slice-competition method (슬라이스 경쟁 방식을 이용한 고속 블럭 정합 알고리즘)

  • Jeong, Yeong-Hun;Kim, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.6
    • /
    • pp.692-702
    • /
    • 2001
  • In this paper, a new block-matching algorithm for standard video encoder is proposed. The algorithm finds a motion vector using the increasing SAD transition curve for each predefined candidates, not a coarse-to-fine approach as a conventional method. To remove low-probability candidates at the early stage of accumulation, a dispersed accumulation matrix is also proposed. This matrix guarantees high-linearity to the SAD transition curve. Therefore, base on this method, we present a new fast block-matching algorithm with the slice competition technique. The Candidate Selection Step and the Candidate Competition Step makes an out-performance model that considerably reduces computational power and not to be trapped into local minima. The computational power is reduced by 10%~70% than that of the conventional BMAs. Regarding computational time, an 18%~35% reduction was achieved by the proposed algorithm. Finally, the average MAD is always low in various bit-streams. The results were also very similar to the MAD of the full search block-matching algorithm.

  • PDF

Design of A Sequence Switch Coding Circuit Without Using Auxiliary Lines (보조선을 사용하지 않은 Sequence Switch Coding 회로의 설계)

  • Yoon, Myung-Chul
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.11
    • /
    • pp.24-33
    • /
    • 2009
  • The transition of auxiliary lines for transmitting coding information has been one of the major obstacles to restricting the scalability of Sequence Switch Coding (SSC) algorithms. A new design of SSC which does not use auxiliary lines is presented in this paper. The new design makes overhead transitions far less than the previous designs that use auxiliary lines. By applying the new technique, more than 50% of overhead transitions have been reduced, leading to the increase of 30% of the overall efficiency of SSC algorithm.