• Title/Summary/Keyword: Primitive

Search Result 1,232, Processing Time 0.029 seconds

Implementation of ATPG for IdDQ testing in CMOS VLSI (CMOS VLSI의 IDDQ 테스팅을 위한 ATPG 구현)

  • 김강철;류진수;한석붕
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.3
    • /
    • pp.176-186
    • /
    • 1996
  • As the density of VLSI increases, the conventional logic testing is not sufficient to completely detect the new faults generated in design and fabrication processing. Recently, IDDQ testing becomes very attractive since it can overcome the limitations of logic testing. In this paper, G-ATPG (gyeongsang automatic test pattern genrator) is designed which is able to be adapted to IDDQ testing for combinational CMOS VLSI. In G-ATPG, stuck-at, transistor stuck-on, GOS (gate oxide short)or bridging faults which can occur within priitive gate or XOR is modelled to primitive fault patterns and the concept of a fault-sensitizing gate is used to simulate only gates that need to sensitize the faulty gate because IDDQ test does not require the process of fault propagation. Primitive fault patterns are graded to reduce CPU time for the gates in a circuit whenever a test pattern is generated. the simulation results in bench mark circuits show that CPU time and fault coverage are enhanced more than the conventional ATPG using IDDQ test.

  • PDF

Synthesis of Asynchronous Sequential Circuits using Transition-Sensitive Flip-Flops (Transition-Sensitive Flip-Flops에 의한 비동기 순서논리회로의 합성에 관한 연구)

  • 임제석;이근영
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.12 no.2
    • /
    • pp.24-27
    • /
    • 1975
  • A Synthesis method for multiple-input change transition-sensitive asynchronous sequential circuits is proposed. Both internal states and output states are synthesized from primitive flow tables. It is Btown that cur realization is faster than that of Chuang's. It is pointed out that Chuang's realization of output states contains malfunctions. In this paper, output stales are easily realized from primitive flaw table by the method of controlled excitation.

  • PDF

Behavior Planning for Humanoid Robot Using Behavior Primitive (행동 프리미티브 기반 휴머노이드 로봇의 행동 계획)

  • Noh, Su-Hee;Kim, Yong-Tae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.1
    • /
    • pp.108-114
    • /
    • 2009
  • In this paper, we presents a behavior planning for humanoid robots using behavior primitive in 3 dimensional workspace. Also, we define behavior primitives that humanoid robot accomplishes various tasks effectively. Humanoid robot obtains information of the outside environment and its inner information from various sensors in complex workspace with various obstacles. We verify our approach on a developed small humanoid robot using embedded vision and sensor system in a experimental environment. The experimental results show that the humanoid robot performs its tasks fast and effectively.

A Syntactic Structure Analysis of Hangul Using the Primitive Transformation (원소 변환을 이용한 한글 패턴의 구조 분석)

  • 강현철;최동혁;이완주;박규태
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.12
    • /
    • pp.1956-1964
    • /
    • 1989
  • In this paper, a new method of Hangul recognition is proposed to solve the problems of misrecognition owing to the contacts of FCEs (Fundamental Character Elements) in a Hangul pattern. Structures of FCFs are represented with PAG(Programmed Array Grammar) to recognize an input pattern on 2-D. array of pels., and the unnecessary deformation of the conventional approach can be eliminated by using PEACE parsing which extracts primitives and computes attributes in the course of analyzing the structure of an input pattern. Also, primitive transformation at contacts can afford to confirm all the possible structures of an input pattern and solve the problem of misrecognition owing to the contacts of FCEs. The recognition rate of proposed method for printed Hangul characters shows 96.2% for 1978 Gothic-letters and 92.0% for 1920 Myng-style-letters, respectively.

  • PDF

Representation of Uncertain Geometric Robot Environment Using Fuzzy Numbers

  • Kim, Wan-Joo-;Ko, Joong-Hyup;Chung, Myung-Jin
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1211-1214
    • /
    • 1993
  • In this paper, we present a fuzzy-number-oriented methodology to model uncertain geometric robot environment and to manipulate geometric uncertainty between robot coordinate frames. We describe any geometric primitive of robot environment as a parameter vector in parameter space. Not only ill-known values of the parameterized geometric primitive but the uncertain quantities of coordinate transformation are represented by means of fuzzy numbers restricted to appropriate membership functions. For consistent interpretation about geometric primitives between different coordinate frames, we manipulate these uncertain quantities using fuzzy arithmetic.

  • PDF

Hierarchical Shape Decomposition of Grayscale Image (다치영상의 계층적 형상분해)

  • 최종호
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.595-598
    • /
    • 2004
  • In this paper, a shape decomposition method using morphological operations is studied for decomposing the complex shape in 2-D mage into its simple primitive elements. The serious drawback of conventional shape representation algorithm is that the primitive elements are extracted too much to represent the shape and the processing time is long. To solve these problems, a new shape decomposition algorithm using the 8 bit planes obtained from gray code is proposed.

  • PDF

New Proof of Minimum Distance for Binary Cyclic Codes with $d_{min}$=5 (최소거리가 5인 이진 순회부호의 최소거리에 관한 새로운 증명)

  • 노종선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10A
    • /
    • pp.1576-1581
    • /
    • 2000
  • We investigated into the minimum distance of a primitive binary cyclic code C with a generator polynomial g(x)=$m_1(x)m_{d}(x)$. It is known that the necessary and sufficient condition for C to have minimum distance five is the fact that \ulcorner is an APN power function. In this paper we derived the new proof of minimum distance for the primitive binary cyclic codes with minimum distance five.

  • PDF

A Study on the Contents and Sentences of Korean Abstract (한국어(韓國語) 초록문(抄錄文)의 문장(文章)과 내용(內容)에 대한 연구(硏究))

  • Lee, Tae-Young
    • Journal of Information Management
    • /
    • v.21 no.1
    • /
    • pp.1-33
    • /
    • 1990
  • This paper examines the English and Korean abstracts using the part of speech, case, primitive action. primitive state, measures the length of abstracts and individual sentences and analyzes the structures of sentences. In turn, the possible frames of abstract sentences are suggested.

  • PDF

Effects of Al3+ precipitation onto primitive amorphous Cu-Zn precipitate on methanol synthesis over Cu/ZnO/Al2O3 catalyst

  • Jeong, Cheonwoo;Park, Jongha;Kim, Jinsung;Baik, Joon Hyun;Suh, Young-Woong
    • Korean Journal of Chemical Engineering
    • /
    • v.36 no.2
    • /
    • pp.191-196
    • /
    • 2019
  • The phase of Cu,Zn,Al precursors strongly affects the activity of their final catalysts. Herein, the Cu,Zn,Al precursor was prepared by precipitation of $Al^{3+}$ onto primitive, amorphous Cu,Zn precipitate. This precursor turned out to be a phase mixture of zincian malachite and hydrotalcite in which the latter phase was less abundant compared to the co-precipitated precursor. The final catalyst derived from this precursor exhibited a little higher copper surface area and methanol synthesis activity than the co-precipitated counterpart. Therefore, the two precursor phases need to be mixed in an adequate proportion for the preparation of active $Cu/ZnO/Al_2O_3$ catalyst.

SIMPLE ZEROS OF L-FUNCTIONS AND THE WEYL-TYPE SUBCONVEXITY

  • Peter Jaehyun Cho;Gyeongwon Oh
    • Journal of the Korean Mathematical Society
    • /
    • v.60 no.1
    • /
    • pp.167-193
    • /
    • 2023
  • Let f be a self-dual primitive Maass or modular forms for level 4. For such a form f, we define Nsf(T):=|{ρ ∈ ℂ : |𝕵(ρ)| ≤ T, ρ is a non-trivial simple zero of Lf(s)}|.. We establish an omega result for Nsf(T), which is $N^s_f(T) = \Omega(T^{\frac{1}{6}-{\epsilon}})$ for any ∊ > 0. For this purpose, we need to establish the Weyl-type subconvexity for L-functions attached to primitive Maass forms by following a recent work of Aggarwal, Holowinsky, Lin, and Qi.