• Title/Summary/Keyword: digital automata

Search Result 36, Processing Time 0.034 seconds

A Study on the Characteristics of Topological Invariant Expression in the Space of Digital Architecture (디지털건축공간에 나타난 위상기하학적 불변항의 표현특성에 관한 연구)

  • Bae Kang-Won;Park Chan-Il
    • Korean Institute of Interior Design Journal
    • /
    • v.14 no.3 s.50
    • /
    • pp.64-72
    • /
    • 2005
  • The purpose of this study is to propose a topological design principles and to analyze the space of digital architecture applying topological invariant expressive characteristics. As this study is based on topology as a science of true world's pattern, we intented to explain the concepts and provide some methods of low-level and hyperspace topological invariant Properties. Four major aspects are discussed. Those are connection theory, boundary concept, homotopy group, knot Pattern theory as topological invariant properties. Then we intented to make understand topological characteristics of the Algorithms, luring machine, cellular automata, string theory, membrane, DNA and supramolecular chemistry. In fine, the topological invariant properties of the digital architecture as genetic algorithms based on self-organization and heterogeneous networks of interacting actors can be analyzed and used as a critical tool. Therefore topology can be provided endless possibilities for architecture, designers and scientists intended in expressing the more complex and organic patterns of nature as life.

Comparing of Blind Watermarking Method using DWT and CAT (DWT와 셀룰라 오토마타 변환을 이용한 블라인드 워터마킹 비교)

  • Gong, Hui;Shin, Jin-Wook;Yoon, Sook;Park, Dong-Sun
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.4
    • /
    • pp.92-100
    • /
    • 2011
  • In this paper, we propose a novel blind digital watermarking method based on a cellular automata transform (CAT). CAT is based on dynamic systems known as cellular automata(CA) and uses transform bases which are differently defined by a rule number, the number of neighbors, the number of cells, and an initial state, etc. The proposed CAT based method is compared with a blind watermarking method based on DWT which is commonly used for a domain transform in signal processing. We analyse properties on changes of DWT coefficients and CAT coefficients under various attacks and determine optimal parameters for a watermarking method robust to attacks. The simulations show that the watermarked images with high PSNR and MSSIM look visually identical to originals and are robust against most of typical image processing attacks. Moreover, the proposed CAT based watermarking method is superior to the DWT based one in robustness to most of typical image processing attacks including JPEG compression, median and average filtering, scaling, cropping, and histogram equalization.

Design of a Fast Adder Using Robust QCA Design Guide (강건 QCA 설계 지침을 이용한 고속 가산기 설계)

  • Lee Eun-Choul;Kim Kyo-Sun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.4 s.346
    • /
    • pp.56-65
    • /
    • 2006
  • The Quantum-dot Cellular Automata (QCA) can be considered as a candidate for the next generation digital logic implementation technology due to their small feature sizes and ultra low power consumption. Up to now, several designs using Uh technology have been proposed. However, we found not all of the designs function properly. Furthermore, no general design guidelines have been proposed so far. A straightforward extension of a simple functional design pattern may fail. This makes designing a large scale circuits using QCA technology an extremely time-consuming process. In this paper, we show several critical vulnerabilities related to unbalanced input paths to QCA gates and sneak noise paths in QCA interconnect structures. In order to make up the vulnerabilities, a disciplinary guideline will be proposed. Also, we present a fast adder which has been designed by the discipline, and verified to be functional by the simulation.

Characterization of Uniform/Hybrid Complemented Group Cellular Automata with Rules 195/153/51 (전이규칙 195,153,51을 갖는 Uniform/Hybrid 여원 그룹 셀룰라 오토마타의 특성화)

  • Hwang, Yoon-Hee;Cho, Sung-Jin;Choi, Un-Sook;Kim, Seok-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.315-318
    • /
    • 2005
  • Recently, the advent of wireless communication and other handhold devices like Personal Digital Assistants and smart cards have made in implementation of cryptosystems a major issue. One important aspect of modern day ciphers is the scope for hardware sharing between the encryption and decryption algorithm. The cellular Automata which have been proposed as an alternative to linear feedback shift registers(LFSRs) can be programmed to perform the operations without using any dedicated hardware. But to generalize and analyze CA is not easy. In this paper, we characterizes uniform/hybird complemented group CA with rules 195/153/51 that divide the entire state space into smaller spaces of maximal equal lengths. This properties can be useful in constructing key agreement algorithm.

  • PDF

Design of XOR Gate Based on QCA Universal Gate Using Rotated Cell (회전된 셀을 이용한 QCA 유니버셜 게이트 기반의 XOR 게이트 설계)

  • Lee, Jin-Seong;Jeon, Jun-Cheol
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.3
    • /
    • pp.301-310
    • /
    • 2017
  • Quantum-dot cellular automata(QCA) is an alternative technology for implementing various computation, high performance, and low power consumption digital circuits at nano scale. In this paper, we propose a new universal gate in QCA. By using the universal gate, we propose a novel XOR gate which is reduced time/hardware complexity. The universal gate can be used to construct all other basic logic gates. Meanwhile, the proposed universal gate is designed by basic cells and a rotated cell. The rotated cell of the proposed universal gate is located at the central of 3-input majority gate structure. In this paper, we propose an XOR gate using three universal gates, although more than five 3-input majority gates are used to design an XOR gate using the 3-input majority gate. The proposed XOR gate is superior to the conventional XOR gate in terms of the total area and the consumed clock because the number of gates are reduced.

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.

Multi-Layer QCA 4-to-1 Multiplexer Design with Multi-Directional Input (다방위 입력이 가능한 다층구조 QCA 4-to-1 멀티플렉서 설계)

  • Jang, Woo-Yeong;Jeon, Jun-Cheol
    • The Journal of the Convergence on Culture Technology
    • /
    • v.6 no.4
    • /
    • pp.819-824
    • /
    • 2020
  • In this paper, we propose a new multiplexer using quantum dot cellular automata (QCA), a next-generation digital circuit design technology. A multiplexer among digital circuits is a circuit that selects one of the input signals and transfers the selected input to one line. Since it is used in many circuits such as D-flip-flops, resistors, and RAM cells, research has been conducted in various ways to date. However, the previously proposed planar structure multiplexer does not consider connectivity, and therefore, when designing a large circuit, it uses an area inefficiently. There was also a multiplexer proposed as a multi-layer structure, but it does not improve the area due to not considering the interaction between cells. Therefore, in this paper, we propose a new multiplexer that improves 38% area reduction, 17% cost reduction, and connectivity using a cell-to-cell interaction and multi-layer structure.

Digital Logic Extraction from QCA Designs (QCA 설계에서 디지털 논리 자동 추출)

  • Oh, Youn-Bo;Kim, Kyo-Sun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.1
    • /
    • pp.107-116
    • /
    • 2009
  • Quantum-dot Cellular Automata (QCA) is one of the most promising next generation nanoelectronic devices which will inherit the throne of CMOS which is the domineering implementation technology for large scale low power digital systems. In late 1990s, the basic operations of the QCA cell were already demonstrated on a hardware implementation. Also, design tools and simulators were developed. Nevertheless, its design technology is not quite ready for ultra large scale designs. This paper proposes a new approach which enables the QCA designs to inherit the verification methodologies and tools of CMOS designs, as well. First, a set of disciplinary rules strictly restrict the cell arrangement not to deviate from the predefined structures but to guarantee the deterministic digital behaviors is proposed. After the gate and interconnect structures of. the QCA design are identified, the signal integrity requirements including the input path balancing of majority gates, and the prevention of the noise amplification are checked. And then the digital logic is extracted and stored in the OpenAccess common engineering database which provides a connection to a large pool of CMOS design verification tools. Towards validating the proposed approach, we designed a 2-bit adder, a bit-serial adder, and an ALU bit-slice. For each design, the digital logic is extracted, translated into the Verilog net list, and then simulated using a commercial software.

Algorithm for Generating Traffic Distributions in ATM Networks using 2-D LHCA

  • Cho, Sung-Jin;Kim, Seok-Tae;Kim, Jae-Gyeom;Kim, Han-Doo;Park, Un-Sook
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.2
    • /
    • pp.176-183
    • /
    • 1999
  • Using Asynchronous Transfer Mode(ATM) which is a high-bandwidth, low-delay, cell switching and multiplexing technology, Broadband-Integrated Services Digital Network (B-ISDN) can support communication services of all kinds. To evaluate the performance of ATM networks, traffic source models to meet the requirements are demanded. We can obtain random traffic distribution for ATM networks by using the Cellular Automata (CA) which have effective random pattern generation capability. In this paper we propose an algorithm using 2-D LHCA to generate more effective random patterns with good random characteristics. And we show that the randomness by 2-D LHCA is better than that of the randomness by 1-D LHCA.

  • PDF

Evaluation of the Performance and Reliability of a Real-time Power System Described by a DES Model using Fuzzy-Random Variables (퍼지-랜덤 변수를 이용한 DES 모델링을 통한 실시간 전력 시스템의 성능 및 신뢰도 평가)

  • Min, Byeong-Jo;Lee, Seok-Ju;Kim, Hak-Bae
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.7
    • /
    • pp.363-369
    • /
    • 2000
  • To flexibly evaluate performance and reliability of an electric power system in the aspect of the real-time system which is intrinsically characterized by stringent timing constraints fails catastrophically if its control input is not updated by its digital controller computer within a certain time limit called the hard deadline, we propose fuzzy-random variables and build a discrete event model embedded with fuzzy-random variables. Also, we adapt fuzzy-variables to a path-space approach, which derives the upper and lower bounds of reliability by using a semi-Markov model that explicitly contains the deadline information. Consequently, we propose certain formulas of state automata properly transformed by fuzzy-random variables, and present numerical examples applying the formulas as well.

  • PDF