• Title/Summary/Keyword: Finite-State Machine

Search Result 230, Processing Time 0.025 seconds

The State CHDL Description and Symbolic Minimization Algorithm Development for State Machine Synthesizer (상태합성기 설계를 위한 상태 CHDL 기술 및 기호최소화 알고리듬개발)

  • Kim, Hi-Seok
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.5
    • /
    • pp.127-136
    • /
    • 1989
  • A Symbolic cover Minimization Algorithm and State CHDL Description for Finite State Machine Synthesizer are Presented. State CHDL are used for design of PLA based finite state machine, also the symbolic cover minimization algorithms are based upon single cube containment and distance 1 merging algorithms. The procedure for state machine synthesizer has been applied to practical example, including traffic light controller by using Boulder Optimal Logic Design System.

  • PDF

SUMS AND JOINS OF T-FUZZY TRANSFORMATION SEMIGROUPS

  • Cho, Sung-Jin;Kim, Jae-Gyeom
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.1
    • /
    • pp.273-283
    • /
    • 2001
  • We introduce sums and joins of T-fuzzy transformation semi-groups and investigate their algebraic structures.

Analysis of Transfer Lines with Finite Storage Buffers (제한된 크기의 버퍼를 가진 생산 시스템의 분석)

  • 허성관;하정진
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.15 no.26
    • /
    • pp.151-157
    • /
    • 1992
  • This paper presents a method for analyzing the transfer lines with finite storage buffers. Each machine spends a random amount of time processing each material. This transfer line can be modeled by the tandem queueing system with finite buffers. The great dimensionality of the state space renders the analysis of such system a formidable task. We propose an efficient algorithm to obtain the marginal state probabilities based on the exact algorithm for the two-machine system. Other performance measures, such as the utilization, the blocking probability, the average sojourn time, and the average queue length, can be easily calculated.

  • PDF

A Design of Modified Euclidean Algorithm using Finite State Machine (FSM을 이용한 수정된 유클리드 알고리즘 설계)

  • Kang, Sung-Jin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.6
    • /
    • pp.2202-2206
    • /
    • 2010
  • In this paper, an architecture for modified Euclidean(ME) algorithm is proposed, which is using finite-state machine(FSM) instead of degree computation. Since the proposed architecture does not have degree computation circuits, it is possible to reduce the hardware complexity of RS(Reed-Solomon) decoder, so that a very high-speed RS decoder can be implemented. RS(255,239) decoder with the proposed architecture is implemented using Verilog-HDL and requires about 13% fewer gate counts than conventional one.

A study on The Implementation of Monster AI using Finite-State Machine (유한 상태 기계를 이용한 몬스터 AI 구현에 관한 연구)

  • Jo, Jae-Won;Bang, Jung-Won
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2019.01a
    • /
    • pp.349-350
    • /
    • 2019
  • 게임에서 장르를 불문하고 모든 몬스터와 NPC는 AI를 가지고 있다. 따라서 적 몬스터 캐릭터와 전투를 즐기는 액션 게임의 경우 그만큼 인공지능이 게임 안에서 차지하는 비율이 높다고 할 수 있을 것이다. 본 논문에서는 FSM, HFSM, BT와 같은 AI 기법을 비교하여 분석하였다. 각 기법에는 주의해야 할 점이 명확하게 존재하기 때문에 구체적으로 어떠한 문제점들이 존재하는지에 대한 결과를 얻는데 연구 목적이 있다. 따라서 몬스터 AI를 구현할 때 각 인공지능 기법의 장단점을 고려하여 설계하여 유지 보수를 줄이는 방법을 연구해야 한다는 것을 확인할 수 있었다.

  • PDF

A Design of the Finite State Machine to Control User's Gaze on a Screen (화면 응시 제어를 위한 유한 상태 기계 설계)

  • Moon, Bong-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.5
    • /
    • pp.127-134
    • /
    • 2011
  • A finite state machine was designed to control user's gaze on the screen when the user is monitoring the. It consists of a set of situations where pupils are gazed and a set of states which decide the gaze on a screen or sleeping. The states were especially classified into main states, pre-states and potential states. The machine uses the situation history, which decide current state using continuous previous situation and current situation, and improves the accuracy to control the gaze on a screen. We implemented the machine with the data which were get using a pupil detection method, and tested the verification of the system with monitoring operations. The experimentation using the method which get date from real images shows advantage of decision whether it is temporary gaze or long-term gaze.

MFSM-based Multi-MRF Synchronization Model in 3GPP2 (3GPP2 환경에서 MFSM기반 Multi-MRF 동기화 모델)

  • 신동진;김수창;문승현;송병권;정태의
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.109-111
    • /
    • 2002
  • 기존의 많은 동기화 모델 중 EFSM(Extended Finite State Machine)기반 동기화 모델을 수정 보완한 MFSM(Modified Finite State Machine)을 제안한다. MFSM은 미디어간 동기화를 위한 Intermedia Synchronization 역할을 Sync Master와 Sync Slave로 나누어 기존 논문의 단점을 보완한다. 3GPP2 환경에서 멀티미디어 데이터 송수신시에 미디어 소스간에 동기화를 위해서 MRF(Media Resource Function)가 데이터를 중계하는 MFSM기반의 동기화 모델을 제안한다.

  • PDF

A Synchronized Scheme Applying on Hybrid in On-Line Game (온라인 게임에서의 하이브리드기법을 적용한 동기화 기법)

  • Kime, Hye-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.2
    • /
    • pp.7-12
    • /
    • 2011
  • Because development of high speed network, spread of internet, and high quality of computer performance, request and internet about massive multiplayer playing the game, is increasing. In order to experience realistic game play which is one of the most importance factor in massive multiplayer on-line, synchronization is importance matter. We propose synchronized and optimized scheme that combined FSM (Finite State Machine) and event holding method for efficient state synchronization for massive multiplayer on-line, and we show the effectiveness and reliability of our proposed scheme through the implementing and testing of the game server applying on our proposed scheme.

Corrective Control of Input/Output Asynchronous Sequential Machines for Overcoming Disturbance Inputs (외란 입력을 극복하기 위한 입력/출력 비동기 머신의 교정 제어)

  • Yang, Jung-Min;Kwak, Seong-Woo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.3
    • /
    • pp.591-597
    • /
    • 2009
  • The problem of controlling a finite-state asynchronous sequential machine is examined. The considered machine is governed by input/output control, where access to the state of the machine is not available. In particular, disturbance inputs can infiltrate into the asynchronous machine and provoke unauthorized state transitions. The control objective is to use output feedback to compensate the machine so that the closed-loop system drive the faulty asynchronous machine from a failed state to the original one. Necessary and sufficient condition for the existence of appropriate controllers are presented in a theoretical framework. As a case study, the closed-loop system of an asynchronous machine with the proposed control scheme is implemented in VHDL code.

Signal-Dependent Chaotic-State-Modulated Digital Secure Communication

  • Farooq, Omar;Datta, Sekharjit
    • ETRI Journal
    • /
    • v.28 no.2
    • /
    • pp.250-252
    • /
    • 2006
  • In this letter, a discrete state, discrete time chaotic pseudo random number generator (CPRNG) is presented for stream ciphering of text, audio, or image data. The CPRNG is treated as a finite state machine, and its state is modulated according to the input bit sequence of the signal to be encrypted. The modulated state sequence obtained can be transmitted as a spread spectrum or encrypted data.

  • PDF