• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.3
• /
• pp.305-311
• /
• 2017

We investigate periodicities of characteristic matrices of some hybrid cellular automata configured with rules 60 and 102 and an intermediate boundary condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6C
• /
• pp.361-367
• /
• 2011

In this paper, we propose encryption method to using complemented MLCA(Maximum Length Cellular Automata) based on NBCA(Null Boundary CA) and 2D CAT (Two-Dimensional Cellular Automata Transform) for efficient image encryption. The encryption method is processed in the following order. First, a transition matrix T is created using the Wolfram Rule matrix. Then, the transition matrix T is multiplied to the original image that is intended to be encrypted, which transfers the pixel values of the original image. Furthermore, the converted original image goes through a XOR operation with complemented vector F to convert into a complemented MLCA applied image. Then, the gateway value is set and 2D CAT basis function is created. Also, the 2D CAT is encrypted by multiplying the created basis function to the complemented MLCA applied image. Lastly, the stability analysis verifies that proposed method holds a high encryption quality status.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.670-678
• /
• 2005

A Cellular Automaton(CA) is a dynamical system in which space and time are discrete, the state of each cell is unite and is updated by local interaction. Since the characteristics of CA is diffusion and local interaction, CA is used by crypto-systems and VLSI structure. In this study, we proposed a hash function based on the concept of 2-dimensional cellular automata and analyzed the proposed hash function.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.8
• /
• pp.752-757
• /
• 2000

The recursive formulae, which can self-reproduce the state transition graphs, of one-dimensional cellular automata rule 15 with two states (0 and 1) and four different boundary conditions were founded by categorical access. The categorical access makes the evolution process for cellular automata be expressed easily since it enables the mapping of automata between different domains.

• Journal of Advanced Navigation Technology
• /
• v.18 no.2
• /
• pp.178-184
• /
• 2014

CMOS technology based on PCA is very efficient at an implementation of memory or ALU. However, there has been a growing interest in quantum-dot cellular automata (QCA) because of the limitation of CMOS scaling. In this paper, we propose a design of PCA architecture based on QCA. In the proposed PCA design, we utilize D flip-flop and XOR logic gate without wire crossing technique, and design a input and rule control switches. In experiment, we perform the simulation of the proposed PCA architecture by QCADesigner. As the result, we confirm the efficiency the proposed architecture.

• Journal for History of Mathematics
• /
• v.12 no.1
• /
• pp.73-81
• /
• 1999

We survey the researches on self-reproducing structures on cellular automata. Self-reproduction is the foremost characteristic of life, and cellular automata are ideal model for studying artificial life. From the early studies by Von Neumann to late results on computational models using self-reproducing structures and emergence of self-replication are covered. Also possible applications of self-replicating structures are listed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.711-714
• /
• 2001

We present a detailed analysis of the behavior of a multiple-attractor cellular automata.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.263-266
• /
• 1996

Cellular Automata are a discrete mathematical system whose evolution is governed by a deterministic rule involving local interactions. In this paper, one designed and implemented the evolution system based on GUI which can analyse how random intitial stated evolve easily.

• 한국ITS학회:학술대회논문집
• /
• 2005.11a
• /
• pp.186-190
• /
• 2005

• ETRI Journal
• /
• v.42 no.6
• /
• pp.912-921
• /
• 2020

Quantum-dot cellular automata (QCA) is an alternative complementary metal-oxide-semiconductor (CMOS) technology that is used to implement high-speed logical circuits at the atomic or molecular scale. In this study, an optimal 2-to-4 decoder in QCA is presented. The proposed QCA decoder is designed using a new formulation based on the MV32 gate. Notably, the MV32 gate has three inputs and two outputs, which is equivalent two 3-input majority gates, and operates based on cellular interactions. A multilayer design is suggested for the proposed decoder. Subsequently, a new and efficient 3-to-8 QCA decoder architecture is presented using the proposed 2-to-4 QCA decoder. The simulation results of the QCADesigner 2.0.3 software show that the proposed decoders perform well. Comparisons show that the proposed 2-to-4 QCA decoder is superior to the previously proposed ones in terms of cell count, occupied area, and delay.