• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.275-277
• /
• 2003

본 논문에서는 GF(2$^{m}$ )상에서 비트 직렬 Linear Feedback Shift Register (LFSR) 구조와 비트 병렬 셀룰라 오토마타(Cellular Automata, CA)구조를 혼합한 새로운 하이브리드(Hybrid) 형식의 A$B^2$곱셈기를 제안한다. 본 논문에서 제안한 곱셈기는 제곱연산을 위해 구조적으로 가장 간단한 비트 직렬 구조를 이용하고, 곱셈연산을 위해 시간 지연이 적은 비트 병렬 구조를 이용한다. 제안된 구조는 LFSR의 구조적인 특징과 Periodic Boundary CA (PBCA)의 특성, 그리고 All One Polynomial (AOP)의 특성을 조화시킴으로써 기존의 구조에 비하여 정규성을 높이고 지연 시간을 줄일 수 있는 구조이다. 제안된 곱셈기는 공개키 암호화의 핵심이 되는 지수기의 구현을 위한 효율적인 기본구조로 사용될 것으로 기대된다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.393-396
• /
• 2006

In this paper, we analyze the characteristic polynomials of 90/150 cellular automata which uses only 90, 150 rules as state-transition rules. In particular, we propose the method which the characteristic polynomial is represented as the exponential type of a primitive polynomial by synthesizing 90/150 CA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.433-436
• /
• 2009

Many researchers had made a diversity of attempts for generating pseudorandom sequences such as the method of using LFSR whose characteristic polynomial is a primitive polynomial, of using Cellular Automata and of using quadratic functions. In this paper, we can analyze and characterize the methods for generating maximal period pseudorandom sequences constructed by quadratic functions.

• Annual Conference of KIPS
• /
• 2004.05a
• /
• pp.1003-1006
• /
• 2004

본 논문에서는 몽고메리 모듈러 곱셈(Montgomery Modular Multiplication) 알고리즘을 이용하여 효율적인 모듈러 곱셈기를 제안한다. 본 논문에서 제안한 곱셈기는 프로그램 가능한 셀룰라 오토마타(Programmable Cellular Automata, PCA)를 기반의 구조로 설계되어 하드웨어 복잡도를 줄이고, 곱셈시 몽고메리 알고리즘을 이용하여 일반적인 나눗셈 없이 모듈러 연산을 수행하여 시간 복잡도를 최소화 한다. 제안된 곱셈기는 시간적, 공간적인 면에서 간단하고 효과적으로 구성되어 지수연산을 위한 하드웨어의 하부구조나 오류 수정 코드(Error Correcting Code)의 연산에서 효율적으로 이용될 수 있을 것이다.

• Annual Conference of KIPS
• /
• 2004.05a
• /
• pp.1071-1074
• /
• 2004

최대길이를 갖는 선형유한상태기계(LFSM)가 패턴생성, 신호분석, 암호, 오류정정 부호에 응용되면서 n차 원시다항식을 특성다항식으로 갖는 선형유한상태기계에 관한 연구가 활발하게 이루어지고 있다. 본 논문은 최대길이를 갖는 다양한 셀룰라 오토마타의 효과적인 생성방법을 제안한다. 특성다항식이 n 차 원시다항식인 선형 MLCA로부터 유도된 여원 CA가 MLCA임을 밝히며 여원 MLCA의 여러 가지 성질들을 분석한다. 또한 n-셀 MLCA를 ${\phi}(2^n-1)2^{n+1}/n$개 생성할 수 있음을 보인다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.2
• /
• pp.75-83
• /
• 2004

We present a realization of an LFSM that utilizes an LFSR. This is based on a well-known fact from linear algebra. This structure is used to show that a previous attempt at using a cellular automata in place of an LFSR in constructing a stream cipher did not necessarily increase its security. We also give a general method for checking whether or not a nonlinear filter generator based on an LFSM allows reduction to one that is based on an LFSR and which is vulnerable to Anderson information leakage.

• Journal of Korea Game Society
• /
• v.16 no.6
• /
• pp.59-68
• /
• 2016

Many researchers have paid attention to contents generation within the area of game artificial intelligence these days with various reasons. Efforts on automatic contents generation without game level designers' help were continuously progressed in various game contents. This study suggests an automatic map generation without an isolated cave using cellular automation enhanced by binary space partitioning(BSP). In other words, BSP makes it possible to specify the number of desired area and cellular automation reduces the time to search a path. Based upon our preliminary simulation results, we show the usefulness of our automatic map generation by applying the contents generation using cell automation, which is enhanced by BSP to games.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.6
• /
• pp.2473-2481
• /
• 2013

The two characteristics of two-lane-and-two-way traffic flow are platoon and overtaking triggered by low-speed vehicle. It is crucial to develop a robust model which simultaneously generates the behaviors of platoon by low-speed vehicle and overtaking using opposite lane. Hence, a microscopic two-lane and two-way vehicle model was introduced (B. Yoon, 2011), which is based on CA (Cellular Automata) which is one of discrete time-space models, in Korea. While the model very reasonably explains the behaviour of overtaking low-speed vehicle in stable traffic flow below critical density, it has shortcomings to the overtaking process in unstable traffic flow above the critical density. Therefore, the objective of this study is to develope a vehicle model to more realistically explain overtaking process in unstable traffic flow state based on the model developed in the previous study. The experimental results revealed that the car-following model robustly generates the various macroscopic relationships of traffic flow generating stop-and-go traffic flow and the overtaking model reasonably explains the behaviors of overtaking under the conditions of both opposite traffic flow and stochastic parameter to consider overtaking in unstable traffic flow state. The vehicle model presented in this study can be expected to be utilized for the analysis of two-lane-and-two-way traffic flows more realistically than before.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.1
• /
• pp.107-116
• /
• 2009

Quantum-dot Cellular Automata (QCA) is one of the most promising next generation nanoelectronic devices which will inherit the throne of CMOS which is the domineering implementation technology for large scale low power digital systems. In late 1990s, the basic operations of the QCA cell were already demonstrated on a hardware implementation. Also, design tools and simulators were developed. Nevertheless, its design technology is not quite ready for ultra large scale designs. This paper proposes a new approach which enables the QCA designs to inherit the verification methodologies and tools of CMOS designs, as well. First, a set of disciplinary rules strictly restrict the cell arrangement not to deviate from the predefined structures but to guarantee the deterministic digital behaviors is proposed. After the gate and interconnect structures of. the QCA design are identified, the signal integrity requirements including the input path balancing of majority gates, and the prevention of the noise amplification are checked. And then the digital logic is extracted and stored in the OpenAccess common engineering database which provides a connection to a large pool of CMOS design verification tools. Towards validating the proposed approach, we designed a 2-bit adder, a bit-serial adder, and an ALU bit-slice. For each design, the digital logic is extracted, translated into the Verilog net list, and then simulated using a commercial software.

• Journal of the Korea Society for Simulation
• /
• v.25 no.2
• /
• pp.1-11
• /
• 2016

The floor field model (hereafter referred to as FFM) is a cellular automata (hereafter referred to as CA)-based walk model used to model pedestrian behavior. Existing studies on FFM conducted experiments with simple structures (that have one room or one obstacle in a room) or relatively complicated structures (that have many rooms). In order to apply the FFM to real buildings, it is necessary to have additional methodologies to process information about the number of rooms, floors, stairs, and exit doors. In particular, it is necessary to process exit doors during this procedure. Exit doors that are recognized by pedestrians are of many types such as exit doors in rooms, stairs connected to corridors, and exit doors in a building. When calculating the static floor field (hereafter referred to as SFF) in the FFM, information about exit doors is needed and simulation results will be different depending on how the SFF is calculated using an exit door among the above-mentioned exit doors. In this study, an XML-format building data model is proposed according to data structures required by the FFM. This study also defines a methodology to process a number of exit doors. Accordingly, this study developed a building data construction and evacuation simulator and simulation experiments were conducted with university campus building.