• Title/Summary/Keyword: 셀 오토마타

Search Result 37, Processing Time 0.033 seconds

Analysis of state transition behavior of SPCA (SPCA의 상태전이 행동분석)

  • Cho, S.J.;Choi, U.S.;Hwang, Y.H.;Kwon, M.J.;Lim, J.M.
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.441-445
    • /
    • 2009
  • In this paper we propose the method of generating the maximum length sequence based on Self Programmable Cellular Automata. Recently there is a research trend such that increased CA dimensionality and PCA which applies different rules on the same cell at different time steps can make a sequence with a long period. By changing a cell's state transition rules to give the cell dynamic energy at each time step, we can make the period of a sequence longer and the randomness of a sequence higher.

  • PDF

A Study on the Recurrence for the Transition Functions of Finite Cellular Automata (유한 셀룰러 오토마타 천이함수의 재귀식에 대한 연구)

  • Lee, Hyen-Yeal;Lee, Geon-Seon
    • The KIPS Transactions:PartA
    • /
    • v.14A no.4
    • /
    • pp.245-248
    • /
    • 2007
  • This paper provides some simple recursive formulas generation transition functions of finite cellular automata with triplet local transition functions under two states (0 and 1) and four different boundary conditions (0-0,0-1,1-0,1-1), and classify transition functions into several classes.

Generation of Additive Maximum Length Cellular Automata (최대길이를 갖는 가산 셀룰라 오토마타의 생성)

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

  • PDF

A Study on Automatic Design of Artificial Meural Networks using Cellular Automata Techniques (샐룰라 오토마타 기법을 이용한 신경망의 자동설계에 관한 연구)

  • Lee, Dong-Wook;Sim, Kwee-Bo
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.11
    • /
    • pp.88-95
    • /
    • 1998
  • This paper is the result of constructing information processing system such as living creatures' brain based on artificial life techniques. The living things are best information processing system in themselves. One individual is developed from a generative cell. And a species of this individual has adapted itself to the environment through evolution. In this paper, we propose a new method of designing neural networks using biological inspired developmental and evolutionary concept. Ontogeny of organism is embodied in cellular automata(CA) and phylogeny of species is realized by evolutionary algorithms(EAs). We call 'Evolving Cellular Automata Neural Systems' as ECANSI. The connection among cells is determined by the rule of cellular automata. In order to obtain the best neural networks in given environment, we evolve the arragemetn of initial cells. The cell, that is a neuron of neural networks, is modeled on chaotic neuron with firing or rest state like biological neuron. A final output of network is measured by frequency of firing state. The effectiveness of the proposed scheme is verified by applying it to Exclusive-OR and parity problem.

  • PDF

Research about Urban Growth Model's Automation (도시성장모형의 시뮬레이션 자동화에 관한 연구)

  • Yun, Jeong-Mi;Park, Jeong-Wo
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.11 no.1
    • /
    • pp.1-9
    • /
    • 2008
  • Recently, various researches have been studied on the predict method of land change according to its development. The Cellular Automata(CA) is one of the most popular methods in the urban growth modeling. The basis principle of CA is to repeat operations, which convert the current cell into new cell state by the transaction rule. It will minimize the loss of data by using Fuzzy-AHP and it can lead the flexible urban growth modeling. However, AHP would have a disadvantage to repeat the procedure of the collecting intentions until it derives the weight. Also, it is necessary for the simulation of CA to repeat the operations and the test of data accuracy should be accompanied. The purpose of this study is to predict the Busan city growth model and analyze it according to the automated test method by applying CA as well as Fuzzy-AHP. This study shall improve the difficulties caused by complexity and repetitiveness in the urban grow modeling. The practical modeling could be derived from the verification, and the derived modules could be applied to the similar case studies.

  • PDF

Analysis of Pseudorandom Sequences Generated by Maximum Length Complemented Cellular Automata (최대길이 여원 CA 기반의 의사랜덤수열 분석)

  • Choi, Un-Sook;Cho, Sung-Jin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.5
    • /
    • pp.1001-1008
    • /
    • 2019
  • A high-quality pseudorandom sequence generation is an important part of many cryptographic applications, including encryption protocols. Therefore, a pseudorandom number generator (PRNG) is an essential element for generating key sequences in a cryptosystem. A PRNG must effectively generate a large, high-quality random data stream. It is well known that the bitstreams output by the CA-based PRNG are more random than the bitstreams output by the LFSR-based PRNG. In this paper, we prove that the complemented CA derived from 90/150 maximum length cellular automata(MLCA) is a MLCA to design a PRNG that can generate more secure bitstreams and extend the key space in a secret key cryptosystem. Also we give a method for calculating the cell positions outputting a nonlinear sequence with maximum period in complemented MLCA derived from a 90/150 MLCA and a complement vector.

5-Neighbor Programmable CA based PRNG (프로그램 가능한 5-이웃 CA기반의 PRNG)

  • Choi, Un-Sook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.2
    • /
    • pp.357-364
    • /
    • 2022
  • A pseudo-random number generator (PRNG) is a program used when a large amount of random numbers is needed. It is used to generate symmetric keys in symmetric key cryptography systems, generate public key pairs in public key cryptography or digital signatures, and generate columns used for padding with disposable pads. Cellular Automata (CA), which is useful for specific representing nonlinear dynamics in various scientific fields, is a discrete and abstract computational system that can be implemented in hardware and is applied as a PRNG that generates keys in cryptographic systems. In this paper, I propose an algorithm for synthesizing a programmable 5-neighbor CA based PRNG that can effectively generate a nonlinear sequence using 5-neighbor CA with the radius of the neighboring cell increased by 2.

Implementation of Lava Flow Simulation Program Using Cellular Automata (Cellular Automata를 이용한 용암류 모의 프로그램의 구현)

  • Lee, Chung-Hwan;Hong Lee, Dong-jin;Cha, Eui-young;Yun, Sung-Hyo
    • The Journal of the Petrological Society of Korea
    • /
    • v.26 no.1
    • /
    • pp.93-98
    • /
    • 2017
  • In this paper, we propose a lava flow simulation program to predict the range of lava flows area and thickness of lava flows during volcanic eruptions. The map information is represented as a 'cell' with observed values per fixed area such as DEM and a lava flow prediction algorithm using a cellular automata model is performed to predict the flow of lava flows. To obtain quantitative data of lava flows, fluid properties of lava flows are defined as Bingham plastic fluid and derived equation is applied to the rules of cellular automata. To verify the program, we use a 30m resolution DEM provided by USGS. We compared simulation results with real lava flows for the Pu'u'O'o crater area in Hawaii, which has erupted since May 24, 2016.

Design of QCA Latch Using Three Dimensional Loop Structure (3차원 루프 구조를 이용한 QCA 래치 설계)

  • You, Young-Won;Jeon, Jun-Cheol
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.2
    • /
    • pp.227-236
    • /
    • 2017
  • Quantum-dot cellular automata(QCA) consists of nano-scale cells and demands very low power consumption so that it is one of the alternative technologies that can overcome the limits of scaling CMOS technologies. Various circuits on QCA have been researched until these days, a latch required for counter and state control has been proposed as a component of sequential logic circuits. A latch uses a feedback loop to maintain previous state. In QCA, a latch uses a square structure using 4 clocks for feedback loop. Previous latches have been proposed using many cells and clocks in coplanar. In this paper, in order to eliminate these defects, we propose a SR and D latch using multilayer structure on QCA. Proposed three dimensional loop structure is based on multilayer and consists of 3 layers. Each layer has 2 clock differences between layers in order to reduce interference. The proposed latches are analyzed and compared to previous designs.

Efficient QCA 2-to-4 Enable Decoder Design Based on 4-Universal Gate (4-유니버셜 게이트 기반 효율적인 QCA 2-to-4 인에이블 디코더 설계)

  • Kim, Tae-Woo;Ryu, Jung Hyuk;Jo, Jeong Hoon;Park, Jong Hyuk
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.10a
    • /
    • pp.5-7
    • /
    • 2018
  • VLSI(Very large scale integration) 기술을 통한 트랜지스터의 소형화를 통해 CMOS 집적 회로의 성능은 지속적으로 발전해 왔다. 이와 같은 기술 발전에 따라 집적 회로를 구성하는 디지털 논리 요소 또한 진화를 하고 있다. 디코더는 부호화된 정보를 다시 부호화되기 전으로 되돌아가는 처리를 하는 디지털 논리 요소이며 컴퓨터 설계에서 많이 사용되는 핵심 요소이다. 본 논문에서는 양자점 셀룰라 오토마타(Quantum Cellular-Automata, QCA)를 사용하여 인에이블 입력을 가진 2-to-4 디코더를 제안하였다. 4-입력 유니버설 게이트의 하나의 입력을 1로 고정시켜 3-입력 NOR 게이트로 사용하며, 입력 값 X와 입력 값 Y의 중복된 배선 수를 감소시키고 한 배선으로 두 게이트에 입력을 연결하여 디코더의 배선 수와 배선 교차부를 최소화한다. 제안안하는 4-to-2 인에이블 디코더는 기존 디코더보다 셀의 개수와 클럭수를 감소시켜 디코더의 성능을 더 효율적으로 향상시켰다. 이를 통해 고속 회로 설계에 활용 및 높은 성능을 기대 할 수 있으며 QCA 연구에 기여할 수 있을 것으로 전망 한다.