• MALSORI
• /
• no.50
• /
• pp.51-69
• /
• 2004

In this paper, we present a one-pass semi-dynamic network decoding framework that inherits both advantages of fast decoding speed from static network decoders and memory efficiency from dynamic network decoders. Our method is based on the novel language model network representation that is essentially of finite state machine (FSM). The static network derived from the language model network [1][2] is partitioned into smaller subnetworks which are static by nature or self-structured. The whole network is dynamically managed so that those subnetworks required for decoding are cached in memory. The network is near-minimized by applying the tail-sharing algorithm. Our decoder is evaluated on the 25k-word Korean broadcast news transcription task. In case of the search network itself, the network is reduced by 73.4% from the tail-sharing algorithm. Compared with the equivalent static network decoder, the semi-dynamic network decoder has increased at most 6% in decoding time while it can be flexibly adapted to the various memory configurations, giving the minimal usage of 37.6% of the complete network size.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.79-89
• /
• 2014

It has been an increase in consumers who want a high-capacity and fast speed by the newly diffused mobile device(Smart phones, Ultra books, Tablet PC). As a result, the demand for Flash Memory is constantly increasing. Flash Memory is separated by a NAND-type and NOR-type. NAND-type Flash Memory speed is slow, but price is cheaper than the NOR-type Flash Memory. For this reason, NAND-type Flash Memory is widely used in the mobile market. So Fault Detection is very important for Flash Memory Test. In this paper, Proposed PMBIST for Pattern Test of NAND-type Flash Memory improved Fault detection.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.117-124
• /
• 2006

Hardware and software codesign framework called PeaCE(Ptolemy extension as a Codesign Environment) was developed. It allows to express both data flow and control flow which is described as fFSM which extends traditional finite state machine. While the fFSM model provides lots of syntactic constructs for describing control flow, it has a lack of their formality and then difficulties in verifying the specification. In order to define the formal semantics of the fFSM, in this paper, firstly the hierarchical structure in the model is flattened and then the step semantics is defined. As a result, some important bugs such as race condition, ambiguous transition, and circulartransition can be formally detected in the model.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.78-79
• /
• 2011

대형시스템의 배터리 관리 시스템은 일반적인 운영체제(Operation System)나 실시간 운영체제(Real Time Operation System)를 사용하여 배터리 관리 시스템을 하는 반면 휴대용 전자정보기기와 같은 소형시스템에서는 유한상태머신(Finite State Machine)을 이용한 배터리 관리 시스템을 사용한다. 이러한 대형시스템은 대부분 고성능을 요구하기 때문에 시스템을 유지하기 위해서는 막대한 비용이 들어간다. 이 결과로 상업적 제품의 가격적인 장점을 위하여 특화된 기능만을 지원하는 유한상태머신을 사용하는 배터리 관리 시스템을 많이 이용하고 있다. 최근에는 멀티미디어 기록 및 재생의 많은 전력소모를 요구하는 모바일 시스템이 많아지므로 콘텐츠 기반 배터리 관리 시스템 등 복잡한 배터리 관리 시스템을 소형기기에 적용하기 위하여 많은 연구가 진행되고 있다. 운영체제를 기반으로 하는 배터리 관리 시스템은 모바일 시스템에 사용하기에는 자체 전력소비가 많으며, 유한상태머신을 사용하는 배터리 관리 시스템은 다양한 요구와 복잡한 배터리 관리 시스템의 기능을 수용할 수 없다. 본 논문에서는 상기 두 가지 경우의 장점을 취한 이벤트 드리븐 프로그래밍(Event-Driven Programming) 방식을 사용하여 배터리 관리 시스템을 제안하고 제안된 시스템이 SBS(Smart Battery Data Specification v1.1)[1]를 만족할 수 있음을 보였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.6
• /
• pp.2207-2213
• /
• 2010

A new scheme for variable structure control design which is based on eigenvalues assignment of sliding mode is developed. In conventional methods, generally, specific type of system matrix like canonical or regular form is required to construct a switching surface. Furthermore, the methods are not explicit. The new method in this paper solved the problems. No special type of system matrix is required and very explicit. It is shown that the switching surface can be constructed and determined uniquely without any dependency on the system form. The proposed method is based on the fact that the dynamics of sliding mode is determined by system zeros. Finally, a numerical example is given to verify the validity of the results studied in this paper.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.74-79
• /
• 2009

This paper proposes a hardware structure and associated finite state machine designs sharing key scheduling circuitry to enhance the performance of the block cypher algorithm, HIGHT. It also introduces an efficient protocol applicable to RFID systems comprising the HIGHT block cipher algorithm. The new HIGHT structure occupies an area size small enough to accommodate tag applications. The structure yields twice higher performance them conventional HIGHT algorithms. The proposed protocol overcomes the security vulnerability of RFID tags and thereby strengthens the security of personal information.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.05a
• /
• pp.317-321
• /
• 2006

게임의 재미요소를 증대 시키고, 게임 생명주기(Life-Cycle)를 늘어나게 하기 위해 다양한 방법이 연구 중이다. 현실감 있는 그래픽 효과와 뛰어난 음향 효과 등과 함께 게임 플레이어의 게임 스타일이 반영된 게임을 만들기 위한 방법이 대표적이 예라 할 수 있다. 그 중 게임 플레이어의 스타일을 게임에 다시 이용하기 위해서는 플레이어의 인지과정이 요구되며, 인지된 결과를 이용하여 플레이어를 모델링(User Modeling)한다. 하지만, 게임의 종류와 특성에 따라 다양한 게임이 존재하기 때문에 플레이어를 모델링하기 어렵다는 문제를 가지고 있다. 본 논문에서는 게임에서 정의된 FSM(Finite State machine)을 이용하여 플레이어가 선택한 행동 패턴을 분석하고 적용하는 방법과 다양한 게임에서 이용 할 수 있는 스크립트 형태의 NPC 행동 패턴 변경 방법을 제안한다. 플레이어의 데이터를 분석하여 얻은 결과는 FSM을 변경하여 새로운 행동을 보이는 NPC(Non-Player Characters)를 생성하는데 사용되며, 이 캐릭터는 게임의 특성과 플레이어의 최신 행동 패턴 경향을 학습한 적용형 NPC라 할 수 있다. 실험을 통하여 사용자의 행동과 유사한 패턴을 보이는 NPC의 생성을 확인할 수 있었으며, 게임에서 상대적인 또는 적대적인 캐릭터로 유용하게 사용 될 수 있다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.51-58
• /
• 2004

This paper proposes a new artificial immune approach to on-line hardware test which is the most indispensable technique for fault tolerant hardware. A novel algorithm of generating tolerance conditions is suggested based on the principle of the antibody diversity. Tolerance conditions in artificial immune system correspond to the antibody in biological immune system. In addition, antigen presenting cell (APC) is realized by Quine-McCluskey method in this algorithm and tolerance conditions are generated through GA (Genetic Algorithm). The suggested method is applied to the on-line monitoring of a typical FSM (a decade counter) and its effectiveness is demonstrated by the computer simulation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.31-40
• /
• 2005

In this study, we study measurement of wafer processing throughput and sequence simulation of single wafer type for wafer cleaning equipments that were used for etching, cleaning and polishing of wafer. Based on finite state machine, simulation model was built with identification of robot's status according to scheduling algorithm. Moreover, through performance of simulation as above, throughput per hour of cleaning equipment was measured. By the simulation method that are proposed in this paper, we could measure the wafer throughput per hour according to recipe and robot motion speed, and find optimal recipe and moving sequence of robot that maximize the throughput.

• Journal of Korea Multimedia Society
• /
• v.1 no.1
• /
• pp.109-119
• /
• 1998

This paper describes a research result on automatic generation of Abstract Test Suite from INAP protocol in formal specifications by applying many existing related algorithms such as Rural Chinese Postman Tour and UIO sequence concepts. We use the I/O FSM generated from SDL specifications and a characterizing sequence concepts. We use the I/O FSM generated from SDL specifications and a characterizing sequence, called UIO sequence, is defined for the I/O FSM. The UIO sequence is combined with the concept of Rural Chinese Postman tour to obtain an optimal test sequence. It also proposes an estimation methodology of the fault courage for the Test Suite obtained by our method and their translation into the standardized test notation TTCN.