• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.304-309
• /
• 2003

오류정정부호는 메모리 시스템 설계, 다양한 디지털 데이터 통신 시스템 설계 등에 널리 이용된다. 특히 오늘날과 같이 통신망의 확대와 컴퓨터의 발전으로 인한 대용량 데이터의 교환과 처리가 요구되는 디지털 데이터 통신 시스템 설계에서는 통신 채널에서 발생하는 오류를 효율적으로 제어하기 위한 오류정정부호 장치가 필수불가결한 요소가 되었다. 본 논문에서는 셀룰라 오토마타의 간단하고, 규칙적이며, 모듈화한 특성을 이용하여 이중 오류정정부호의 효율적인 부호화 및 복호화 방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.709-711
• /
• 2001

본 논문에서는 유한 확대 체 GF($^{m}$ )상에서 셀룰라 오토마타를 이용한 곱셈기 구조를 제안한다. 제안된 구조는 기약 다항식으로 AOP(All One Polynomial)의 특성을 사용하고 LSB방식으로 곱셈 연산을 수행한다. 제안된 곱셈기는 지연시간으로 m+1을 갖는 임계경로로는 1- $D_{AND}$+1- $D_{XOR}$를 갖는다. 특히 구조가 정규성, 모듈성, 병렬성을 가지기 때문에 VLSI구현에 효율적이다.적이다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.8 no.4
• /
• pp.71-82
• /
• 1998

해쉬함수는 데이터 무결성과 인증을 달성하기 위해 현대 암호학에서 빈번하게 사용되는 중요한 도구이다. 본 논문에서는 셀룰러 오토마타에 기반한 새로운 해쉬함수를 제안한다. 제안된 해쉬함수의 안전성은 셀룰러 오토마타 이론에 기초하여 분석된다. 그러한 분석은 제안된 해쉬함수가 알려진 공격에 대해 안전하다는 것을 나타태며, 제안된 해쉬함수의 또다른 중요한 특징은 매우 빠르로 하드웨어 구현에 적합하다는 것이다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.115.2-115
• /
• 2001

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. We present a new type of neural architecture consistiong of chaotic neurons and implementation. To evolve chaotic neural systems, we use cellular automata. In order to obtain the best neural networks in the environment, we evolve the arrangement of initial cells. The cell, that is neuron of neural networks, is modeled on chaotic ...

• Journal of the Korean Association of Geographic Information Studies
• /
• v.9 no.1
• /
• pp.116-126
• /
• 2006

The purpose of this study is to analyze the growing course of Busan, Gimhae and Jinhae and further find patterns of the urban growth. This study shows that patterns of the urban growth differ from city to city, being influenced by the city's characteristics. Acknowledging this fact would help the decision maker to determine the developing plan of the urban. The methodology for this study is as follows; Fuzzy set concept is applied to minimize the data loss. At the same time, the AHP is used to give a relative weight to each factor. In order to be able to manage the change based on the dynamic model and time, Cellular Automata is introduced to simulate the growth of urban. The results show that the pattern of Gimhae's and Jinhae's growth is the same, whereas that of Busan is different from them. That is to say, each city has regional characteristics. And the pattern of the urban growth is influenced by the regional conditions of the city.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.3
• /
• pp.593-600
• /
• 2018

Cellular automata (CA) have been applied to effective cryptographic system design. CA is superior in randomness to LFSR due to the fact that its state is updated simultaneously by local interaction. To apply these CAs to the cryptosystem, a study has been performed how to synthesize CA corresponding to given polynomials. In this paper, we analyze the recurrence relations of the characteristic polynomial of the 90 UCA and the characteristic polynomial of the 90/150 CA whose transition rule is <$00{\cdots}001$>. And we synthesize the 90/150 CA corresponding to the trinomials $x^{2^n}+x+1(n{\geq}2)$ satisfying f(x)=f(x+1) using the 90 UCA transition rule blocks and the special transition rule block. We also analyze the properties of the irreducible factors of trinomials $x^{2^n}+x+1$ and propose a 90/150 CA synthesis algorithm corresponding to $x^{2^n}+x^{2^m}+1(n{\geq}2,n-m{\geq}2)$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1939-1946
• /
• 2011

Expander graphs are useful in the design and analysis of communication networks. Mukhopadhyay et. al introduced a method to generate a family of expander graphs based on nongroup two predecessor single attractor CA(Cellular Automata). In this paper we propose a method to generate a family of expander graphs based on 60/102 Null boundary CA(NBCA) which is a group CA. The spectral gap generated by our method is larger than that of Mukhopadhyay et. al [12]. As an application we give an algorithm which generate one-way functions whose security lies on the combinatorial properties of our expander graphs. the one-way function using d-regular graph generated by the 60/102 NBCA is based on the Goldreich's construction [5].

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.2
• /
• pp.23-29
• /
• 2012

Existing pedestrian and evacuation models generally seek to find locally optimal solutions for the shortest or the least time paths to exits from individual locations considering pedestrian's characteristics (eg. speed, direction, sex, age, weight and size). These models are not designed to produce globally optimal solutions that reduce the total evacuation time of the entire pedestrians in a building when all of them evacuate at the same time. In this study, we suggest a globally optimal model for indoor pedestrian evacuation to minimize the total evacuation time of occupants in a building considering different distributions of them. We used the genetic algorithm, one of meta-heuristic techniques because minimizing the total evacuation time can not be easily solved by polynomial expressions. We found near-optimal evacuation path and time by expressing varying pedestrians distributions using chromosomes and repeatedly filtering solutions. In order to express and experiment our suggested algorithm, we used CA(cellular automata)-based simulator and applied to different indoor distributions and presented the results.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.10-19
• /
• 1999

Cellular Automata Neural Systems(CANS) are neural networks based on biological development and evolution. Each neuron of CANS has local connection and acts as a form of pulse according to the dynamics of the chaotic neuron. CANS are generated from initial cells according to the CA rule. In the previous study, to obtain the useful ability of CANS, we make the pattern of initial cells evolve. However, it is impossible to represent all solution space, so we propose an evolving method of CA rule to overcome this defect in this paper. DNA coding has the redundancy and overlapping of gene and is apt for the representation of the rule. In this paper, we show the general expression of CA rule and propose translation method from DNA code to CA rule. The effectiveness of the proposed scheme was verified by applying it to the navigation problem of autonomous mobile robot.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.3
• /
• pp.293-302
• /
• 2016

In this paper we analyze the CA formed by combining the uniform 102 CA $\mathbb{C}_u$ and the m-cell 90/150 hybrid CA $\mathbb{C}_h$ whose characteristic polynomial is $(x+1)^m$. We analyze cycle structures of complemented group CA derived from $\mathbb{C}_u$ and propose a condition of complemented CA dividing the entire state space into smaller cycles of equal lengths. And we analyze the cycle structure of complemented group CA $\mathbb{C}^{\prime}$ derived from the CA $\mathbb{C}$ formed by combining $\mathbb{C}_u$ and $\mathbb{C}_h$ with complement vector F such that $(T+I)^{q-1}F{\neq}0$ where $(x+1)^q$ is the minimal polynomial of $\mathbb{C}$.