• Title/Summary/Keyword: 오토 사이클

Search Result 34, Processing Time 0.022 seconds

Characterization of Hierarchical Cellular Automata (계층적 셀룰라 오토마타의 특성에 관한 연구)

  • Choi, U.S.;Cho, S.J.;Choi, H.H.
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.3
    • /
    • pp.493-499
    • /
    • 2008
  • Cellular Automata(CA) has been used as modeling and computing paradigm for a long time. And CA has been used to model many physical systems. While studying the models of such systems, it is seen that as the complexity of the physical system increase, the CA based model becomes very complex and becomes to difficult to track analytically. Also such models fail to recognize the presence of inherent hierarchical nature of a physical system. In this paper we give the characterization of Hierarchical Cellular Automata(HCA). Especially we analyze transition rules, characteristic polynomials and cyclic structures of HCA.

Design of a New $AB^2$ Multiplier over $GF(2^{m})$ using Cellular Automata ($GF(2^{m})$상에서 셀룰러 오토마타를 이용한 새로운$AB^2$ 연산기 설계)

  • 하경주;구교민;김현성;이형목;전준철;유기영
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2001.11a
    • /
    • pp.302-305
    • /
    • 2001
  • 본 논문에서는 셀룰러 오토마타를 이용하여, GF(2$^{m}$ )상에서 A$B^2$ 연산을 m 클럭 사이클만에 처리할 수 있는 새로운 연산기를 설계하였다. 이는 대부분의 공개키 암호화 시스템에서의 기본 연산인 유한 필드 상의 모듈러 지수(modular exponetiation) 연산기 설계에 효율적으로 이용될 수 있다. 또한 셀룰러 오토마타는 간단하고도 규칙적이며, 모듈화 하기 쉽고 계층화 하기 쉬운 구조이므로 VLSI 구현에도 효율적으로 활용될 수 있다.

  • PDF

Technological Development of Engine for Automobiles (자동차 기관의 최신기술)

  • 조진호
    • Journal of the korean Society of Automotive Engineers
    • /
    • v.9 no.4
    • /
    • pp.15-22
    • /
    • 1987
  • 이상 최근 10년 사이 현저하게 보여준 엔진관계의 신기술과 그 배경 등을 돌아 보았을 때 발전하 는 가운데 특히 4륜차용 2사이클 엔진의 몰락이나 엔진의 주요 부품인 기화기의 쇠태는 그 어느 것이나 시대의 요구에 대한 기술의 한께 혹은 신기술의 개발 템포에 추종키 여려웠던 때문인 것 으로 생각된다. 2사이클 엔진은 비출력이 높고 밸브기구가 없어서 구조가 간단한 등의 장점이 있는 반면 배출가스대책(특히 HC), 경부하시의 부정연소 등의 문제를 가지고 있어 4륜차용으로 서는 배출가스규제를 계기로 SAAB(스웨덴), DKW(서독)의 2사이클 엔진이 자취를 감추게 되었 고 현재 남아있는 것은 일본의 경트럭용 엔진에 지나지 않는다. 또 기화기에 대해서도 배출가 스규제에 대한 대응에 밀려 공연비의 제어성, 고도에 대한 보정성, 내열신뢰성, 제어성, 고도에 대한 보정성, 내열신뢰성, 운전성 등의 요구에 엄해진 반면 흡기포트내(PI), 혹은 흡기관 중양부 내(SPI) 가솔린분사방식에 눌려서 가변벤투리식 등도 미국(1982), 일본(1983)에서 발표되었으나 1985년형의 미국차 엔진에는 기화기의 정착율이 50%에 지나지 않는등승용차용 분야에서는 그 사용이 점차 줄어두는 추세에 있다.

  • PDF

The Performance Analysis of Otto Cycle Engine by Thermodynamic Second Law (오토 사이클 기관의 열역학 제 2법칙적 성능 해석)

  • 김성수;노승탁
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.9 no.6
    • /
    • pp.94-102
    • /
    • 2001
  • The thermodynamic second law analysis, which means available energy or exergy analysis, for the indicated performance of Otto cycle engine has been carried out. Each operating process of the engine is simplified and modeled into the thermodynamic cycle. The calculation of the lost work and exergy through each process has been done with the thermodynamic relations and experimental data. The experimental data were measured from the test of single cylinder Otto cycle engine which operated at 2500 rpm, WOT(Wide Open Throttle) and MBT(Minimum advanced spark timing for Best Torque) condition with different fuels: gasoline, methanol and mixture of butane-methanol called M90. Experimental data such as cylinder pressure, air and fuel flow rate, exhaust gas temperature, inlet gas temperature and etc. were used for the analysis. The proposed model and procedure of the analysis are verified through the comparison of the work done in the study with experimental results. The calculated results show that the greatest lost work is generated during combustion process. And the lost work during expansion, exhaust, compression and induction process follows in order.

  • PDF

Construction of Complemented Hybrid Group Cellular Automata with Maximum Equal Lengths (최대 동일 길이를 갖는 여원 HGCA구성)

  • Cho S.J.;Choi U.S.;Hwang Y.H.;Kim J.G.;Pyo Y.S.;Kim H.D.
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.9
    • /
    • pp.1565-1572
    • /
    • 2006
  • Recently with the ever increasing growth of data communication, the need for security and privacy has become a necessity. The advent of wireless communication and other handheld devices like Personal Digital Assistants and smart cards have made the implementation of cryptosystems a major issue. The Cellular Automata(CA) can be programmed to implement hardware sharing between the encryption and decryption. In this paper, we give conditions for a linear hybrid cellular automata with 60, 102 or 204 to be a linear hybrid group cellular automata C. And we present the conditions which the complemented hybrid group cellular automata C' with complement vectors derived from C has maximum equal lengths in the state transition diagram of C' Also we analyze the relationship among cycles of C' These results generalize Mukhopadhyay's results.

Design of LSB Multiplier using Cellular Automata (셀룰러 오토마타를 이용한 LSB 곱셈기 설계)

  • 하경주;구교민
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.3
    • /
    • pp.1-8
    • /
    • 2002
  • Modular Multiplication in Galois Field GF(2/sup m/) is a basic operation for many applications, particularly for public key cryptography. This paper presents a new architecture that can process modular multiplication on GF(2/sup m/) per m clock cycles using a cellular automata. Proposed architecture is more efficient in terms of the space and time than that of systolic array. Furthermore it can be efficiently used for the hardware design for exponentiation computation.

  • PDF

New Multiplier using Montgomery Algorithm over Finite Fields (유한필드상에서 몽고메리 알고리즘을 이용한 곱셈기 설계)

  • 하경주;이창순
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2002.06a
    • /
    • pp.190-194
    • /
    • 2002
  • Multiplication in Galois Field GF(2/sup m/) is a primary operation for many applications, particularly for public key cryptography such as Diffie-Hellman key exchange, ElGamal. The current paper presents a new architecture that can process Montgomery multiplication over GF(2/sup m/) in m clock cycles based on cellular automata. It is possible to implement the modular exponentiation, division, inversion /sup 1)/architecture, etc. efficiently based on the Montgomery multiplication proposed in this paper. Since cellular automata architecture is simple, regular, modular and cascadable, it can be utilized efficiently for the implementation of VLSI.

  • PDF