• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.224-228
• /
• 2003

물리, 화학, 생물, 공학 등의 학문 분야뿐만 아니라 인공위성과의 통신, 컴퓨터, 컴팩트 디스크 등 첨단산업기술에 까지 광범위하게 응용되고 있는 부호는 입력잘못이나 전파 방해 등 여러 가지 원인으로 오류가 발생할 수 있다. 본 논문에서는 셀룰라 오토마타를 기반으로 하여 검사비트를 생성하고 선형대수 이론을 이용하여 수신된 부호어를 효과적으로 복호할 수 있는 복호기법을 제안한다.

• 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 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.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.3
• /
• pp.118-125
• /
• 2004

The purpose of this study is to decide an appropriate neighborhood and a transition rule of cellular automata by analyzing the past growth process of urban areas in Gimhae. With cellular automata which can manage the change based on the dynamic model and time, this study analyzes the urban growth of Gimhae from 1987 to 2001. Also, through the simulation of different types for neighborhood and transition rules, we can find the appropriate neighborhood and the transition rule for Gimhae. In conclusion, the forecast of physical urban growth pattern is more accurate under conditions when the number of matrixes for the neighborhood is small, the shape of the neighborhood is rectangular, "${\alpha}$" value, which control the pace of urban growth, is low and the transition possibility ($P_{ij}$) is high.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.689-696
• /
• 2010

The goal of this paper is to present a novel method for protecting digital image using 2-D cellular automata transform (CAT). A copyright and transform coefficients are used to generate a new content-based copyright and an original digital image is distributed without any hidden copyright. The parameter, which is called gateway value, for 2-D CAT is consisted of rule number, initial configuration, lattice length, number of neighbors, and etc. Since 2-D CAT has various gateway values, it is more secure than conventional methods. The proposed algorithm is verified using attacked images such as filtering, cropping, JPEG compression, and rotation for robustness.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.112-117
• /
• 2004

In this paper, we propose a suitable multiplication architecture for cellular automata in a finite field $GF(2^m)$. Proposed least significant bit first multiplier is based on irreducible all one Polynomial, and has a latency of (m+1) and a critical path of $ 1-D_{AND}＋1-D{XOR}$.Specially it is efficient for implementing VLSI architecture and has potential for use as a basic architecture for division, exponentiation and inverses since it is a parallel structure with regularity and modularity. Moreover our architecture can be used as a basic architecture for well-known public-key information service in $GF(2^m)$ such as Diffie-Hellman key exchange protocol, Digital Signature Algorithm and ElGamal cryptosystem.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.335-338
• /
• 2005

Though GF(2) CA can only handle data with bit units, GF(2$^{p}$) CA can handle data with byte units. In this paper we analyze the state-transition of nongroup cellular automata(CA) with a single attractor over GF(2$^{p}$). And we propose the constructing method of the state-transition diagram of a linear SACA over GF(2$^{p}$) by using the concept of basic path. Also we propose the state-transition diagram of the nonlinear complemented SACA by using the state-transition diagram of a linear SACA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1201-1208
• /
• 2010

In this paper, we propose an image encryption method using two linear MLCA(Maximum Length Cellular Automata). The encryption method first sets arbitrary 8 bit initial values. Next, we create high quality PN(pseudo noise) sequences by converting rows and columns with the set initial values. hen we generate a basis image using the set PN sequences. Lastly, the final image with high encryption level is produced by XOR operation of the basis image and the original image. In order to verify that the proposed method has the high encryption level, we performed histogram and stability analysis.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.6
• /
• pp.25-30
• /
• 2004

Linear cellular automata(CA) which generate maximum-length cycles, have wide applications in generation of pseudo-random patterns, signature analysis, cryptography and error correcting codes etc. Linear CA whose characteristic polynomial is primitive has been studied. In this paper Ive propose a effective method for generation of a variety of maximum-length CA(MLCA). And we show that the complemented CA's derived from a linear MLCA are all MLCA. Also we analyze the Properties of complemented MLCA. And we prove that the number of n-cell MLCA is ${\phi}(2^{n}-1)2^{n+1}$/n.