• Annual Conference of KIPS
• /
• 2018.10a
• /
• pp.652-655
• /
• 2018

과반수 문제는 전역 문제(global problem) 문제이기 때문에 국소 정보(local information)를 이용해야 하는 셀룰러 오토마타(cellular automata; CA) 상에서 풀기 어려운 문제이다. 본 논문에서는 일차원 CA에서 과반수 문제를 푸는 CA을 찾는 방법을 제안한다. 상태전이 함수를 CA에서 일반적으로 사용되는 규칙 표(rule table)가 아닌 CMR(conditionally matching rules)로 나타내고 진화 알고리즘을 적용하였다. 제안한 방법으로 다수의 서로 다른 규칙들을 찾아낼 수 있었고 찾아낸 규칙은 이전 연구에서 찾아낸 규칙과 유사한 성능을 보여주었다. CA의 문제를 해결하는데 CMR에 진화 알고리즘을 적용하는 것이 효용성이 있음을 보였다.

• Annual Conference of KIPS
• /
• 2001.04a
• /
• pp.371-374
• /
• 2001

본 논문에서는 셀룰라 오토마타(Cellular Automata : CA)를 이용한 다항식 모듈라 멱승 알고리즘을 제안한다. 또한 이를 이용하여 공개키 암호 알고리즘인 EiGamal 알고리즘을 구현한다. 기존의 모듈라 멱승 알고리즘은 대부분 선형 귀환 시프트 레지스트(Linear Feedback Shift Register : LFSR)를 이용하여 구현하였다. 그러나 LFSR을 이용한 구조는 기저가 자주 변경되는 연산에 대하여 구현하기에 곤란한 단점을 가지고 있다. 본 논문에서 제안된 알고리즘은 CA의 병렬성과 높은 적응성을 이용함으로써 기저가 자주 변경되는 멱승 연산 알고리즘에 쉽게 적용할 수 있는 장점이 있다.

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

A secure and novel watermarking system based on complemented Maximum Length Cellular Automata (MLCA) and Two-Dimension Cellular Automata Transform (2D CAT) is proposed. In this watermarking scheme, the original watermark which is first encrypted by complemented MLCA with the private keys, and the encrypted watermark is embedded into the CAT domain of the cover image. Experiment results show that this new method is more secure and provides robust performance against watermarking attacks.

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

• Structural Engineering and Mechanics
• /
• v.77 no.6
• /
• pp.779-795
• /
• 2021

In the recent decades, various optimization algorithms have been considered for the optimization of structures. In this research, a new enhanced algorithm is used for the size and topology optimization of truss structures. This algorithm, which is obtained from the combination of Crow Search Algorithm (CSA) and the Cellular Automata (CA) method, is called CA-CSA method. In the first iteration of the CA-CSA method, some of the best designs of the crow's memory are first selected and then located in the cells of CA. Then, a random cell is selected from CA, and the best design is chosen from the selected cell and its neighborhood; it is considered as a "local superior design" (LSD). In the optimization process, the LSD design is used to modify the CSA method. Numerical examples show that the CA-CSA method is more effective than CSA in the size and topology optimization of the truss structures.

• Journal of Korea Multimedia Society
• /
• v.24 no.3
• /
• pp.406-415
• /
• 2021

The worldwide spread of the Internet and the digital information revolution have resulted in a rapid increase in the use and transmission of multimedia information due to the rapid development of communication technologies. It is important to protect images in order to prevent problems such as piracy and illegal distribution. To solve this problem, I propose a new digital color image encryption algorithm in this paper. I design a new pseudo-random number generator based on 1D five-neighborhood maximum length cellular automata (FN-MLCA) to change the pixel values of the plain image into unpredictable values. And then I use a 3D chaotic cat map to effectively shuffle the positions of the image pixel. In this paper, I propose a method to construct a new MLCA by modeling 1D FN-MLCA. This result is an extension of 1D 3-neighborhood CA and shows that more 1D MLCAs can be synthesized. The safety of the proposed algorithm is verified through various statistical analyses.

• Annual Conference of KIPS
• /
• 2010.04a
• /
• pp.502-504
• /
• 2010

We propose novel transition rule of cellular automata for image enhancement and sharpening algorithm using it. Transition rule present sequential and parallel behavior. it also satisfy Lyapunov function. This image sharpening was developed and experimented by using a dynamic feature of convergence to fixed points. We can obtain efficiently sharpened image by performing arithmetic operation at the gradual parts of difference of brightness without image information.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.534-542
• /
• 2023

The large amount of secondary effects in complementary metal-oxide-semiconductor technology limits its application in the ultra-nanoscale region. Circuit designers explore a new technology for the ultra-nanoscale region, which is the quantum-dot cellular automata (QCA). Low-energy dissipation, high speed, and area efficiency are the key features of the QCA technology. This research proposes a novel, low-complexity, QCA-based one-bit digital comparator circuit for the ultra-nanoscale region. The performance of the proposed comparator circuit is presented in detail in this paper and compared with that of existing designs. The proposed QCA structure for the comparator circuit only consists of 19 QCA cells with two clock phases. QCA Designer-E and QCA Pro tools are applied to estimate the total energy dissipation. The proposed comparator saves 24.00% QCA cells, 25.00% cell area, 37.50% layout cost, and 78.11% energy dissipation compared with the best reported similar design.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.281-283
• /
• 2000

세가지 경계조건에 따른 셀루라 오토마타의 특성다항식을 구하고 이 특성다항식의 성질을 연구한다. 특시 IBCA 의 특성다항식과 NBCA의 특성다항식과의 관계를 제시한다.

• Proceedings of the PSK Conference
• /
• 2000.04a
• /
• pp.172.2-172.2
• /
• 2000