• Title/Summary/Keyword: 조합 논리

Search Result 162, Processing Time 0.028 seconds

A Study on the Design of Binary to Quaternary Converter (2진-4치 변환기 설계에 관한 연구)

  • 한성일;이호경;이종학;김흥수
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.40 no.3
    • /
    • pp.152-162
    • /
    • 2003
  • In this paper, Binary to Quaternary Converter(BQC), Quaternary to Binary Converter(QBC) and Quaternary inverter circuit, which is the basic logic gate, have been proposed based on voltage mode. The BQC converts the two bit input binary signals to one digit quaternary output signal. The QBC converts the one digit quaternary input signal to two bit binary output signals. And two circuits consist of Down-literal circuit(DLC) and combinational logic block(CLC). In the implementation of quaternary inverter circuit, DLC is used for reference voltage generation and control signal, only switch part is implemented with conventional MOS transistors. The proposed circuits are simulated in 0.35 ${\mu}{\textrm}{m}$ N-well doubly-poly four-metal CMOS technology with a single +3V supply voltage. Simulation results of these circuit show 250MHz sampling rate, 0.6mW power consumption and maintain output voltage level in 0.1V.

(The Design of Parallel Ternary-Valued Multiplier Using Current Mode CMOS) (전류모드 CMOS를 사용한 병렬 3치 승산기 설계)

  • Sim, Jae-Hwan;Byeon, Gi-Yeong;Yun, Byeong-Hui;Lee, Sang-Mok;Kim, Heung-Su
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.39 no.2
    • /
    • pp.123-131
    • /
    • 2002
  • In this paper, a new standard basis parallel ternary-valued multiplier circuit designed using current mode CMOS is presented. Prior to constructing the GF(3$^{m}$) multiplier circuit, we provide a GF(3) adder and a GF(3) multiplier with truth tables and symbolize them, and also design them using current mode CMOS circuit. Using the basic ternary operation concept, a ternary adder and a multiplier, we develop the equations to multiply arbitrary two elements over GF(3$^{m}$). Following these equations, we can design a multiplier generalized to GF(3$^{m}$). For the proposed circuit in this paper, we show the example in GF(3$^{3}$). In this paper, we assemble the operation blocks into a complete GF(3$^{m}$) multiplier. Therefore the proposed circuit is easy to generalize for m and advantageous for VLSI. Also, it need no memory element and the latency not less fewer than other circuit. We verify the proposed circuit by functional simulation and show its result.

The Edge Detection of Image using the quantization FCNN with the variable template (가변 템플릿의 양자화 FCNN을 이용한 영상 에지 검출)

  • Choi, Seon-Kon;Byun, Oh-Sung;Lee, Cheul-Hee;Moon, Sung-Ryong
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.11
    • /
    • pp.144-151
    • /
    • 1998
  • In this paper, it is applied the analysis properties of mathematical morphology in order to process MIN/MAX operation on the basis of combination of predefined and weighted structuring element to FCNN having the structure of CNN combined with fuzzy logic between template and input/output. In this paper, as the fuzzy estimator is applied to the image including noise, thus it could be found the noise removal as well as the edge detection in the process of computer simulation. We could analyze and compare the results of edge detection using FCNN, CNN and median filter to which the erosion operation of morphology is applied. This paper could apply the static template and the variable template to FCNN using the quantization fuzzy function, in result we could confirm that the performance of FCNN got to improve in the process of computer simulation.

  • PDF

A Pattern Comparison Algorithm for Pruning Fault Candidates (고장 대상 후보를 줄이기 위한 패턴 비교 알고리즘)

  • Cho, Hyung-Jun;Kang, Sung-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.11
    • /
    • pp.82-88
    • /
    • 2007
  • In this paper, we present a pattern comparison algorithm for reducing fault candidate lists. The number of fault candidates determines the total fault simulation time. To decrease the total fault diagnosis time, the reduction of the number of fault candidates is essential. Critical path tracing determines fault candidate lists detected by a set of tests using a backtracing algorithm starting at the primary outputs of a circuit. The proposed algorithm reduces fault candidates comparing failing patterns with good patterns during critical path tracing process. As we reduce all fault candidates of the circuit to more accurately suspected fault candidates, we can greatly reduce fault simulation time. The proposed algorithm greatly increases simulation speed than that of a conventional backtracing method. The proposed algorithm is applicable to both combinational and sequential circuits. Experimental results on ISCAS#85 and ISCAS#89 benchmark circuits showed fault candidates are pruned and fault diagnosis time is also decreased in proportion to fault candidate decrease.

The Design and Implementation of Restructuring Tool with Logical Analysis of Object-Oriented Architecture and Design Information Recovery (설계 정보 복구와 객체 지향 구조의 논리적 분석을 통한 재구성 툴 설계 및 구현)

  • Kim, Haeng-Gon;Choe, Ha-Jeong;Byeon, Sang-Yong;Jeong, Yeon-Gi
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1739-1752
    • /
    • 1996
  • Software reengineering involves improving the software maintenance process and improving existing systems by applying new technologies and software tools. Software reengineering can help us understand existing systems and discover software components that are common across systems. In the paper, we discuss the program analysis and environment to assist reengineering. Program analysis takesan existing program as input and generates information about structured part and object-oriented part. It is used to restructure the information by extracting code through reengineering methodology. These restructuring informations with object-oriented archilccture are mapping prolog form to query by using direct reation and summary relation.

  • PDF

A Study on the Form of Charms with the Attributes of Experimental Typography (실험 타이포그래피 관점에서의 부적의 조형성)

  • 정성환;김민호
    • Archives of design research
    • /
    • v.14 no.4
    • /
    • pp.99-108
    • /
    • 2001
  • The Charm is composed of various kind of ancient signs, letters and systematic characters so that they delivers messages with many expressions. They, compared with the experimental typography, are more logical and experimental than we generally think. Also, they have meanings and attributes as characters do, in which there are symbols, hieroglyphs, pictures and other similar words. Each attribute diverse from symbolic meaning, associates to deconstruction of letters. It is needed to review the experimental attributes of charms with the view of structural typography for potentialities of expression. The purpose of the study is to analyze and classify the morphologic construction of charms so that we can find the possibilities of applying the attributes to visual languages and typography. Future study seems to be extending the area of expressing of typography fit for our own culture, not for Western

  • PDF

Component Specification Using Z (컴포넌트 명세의 Z 활용)

  • Jang, Jong-Pyo;Lee, Sang-Jun;Kim, Byung-Ki
    • The Journal of Korean Association of Computer Education
    • /
    • v.3 no.2
    • /
    • pp.87-94
    • /
    • 2000
  • Software productivity doesn't satisfy the need of service of software users and software quality isn't improved. Moreover, we still have difficulty in software maintenance. As a plan to counteract solving this crisis, the technology that is called CBSE or Componentware is introduced. Componet Based Software Architecture, one of the technologies associated with CBSE, as a structural description of system, describes both the components composed system of and interaction among these components. Software Architecture provides the technology and the methodology of composition among components in the field of CBSE. is accepted one of core technologies. In this thesis, we analyse information necessary for component specification and then proposed that component specificaton activities using formal specification language Z which is verified with the ability of analysis and logicality. The proposed activities are composed of 9 tasks. By presenting specific 11 products, it is also proposed that component specification activities which is the base of CBSD(ComponentBased Software Development) for reusing.

  • PDF

Ubiquitous Home Networking Architecture based on Virtual Overlay Network (가상 오버레이 네트워크 기반 유비쿼터스홈 네트워킹 구조)

  • Park, Ho-Jin;Park, Jun-Hee;Kim, Nam
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.7
    • /
    • pp.8-17
    • /
    • 2010
  • Ubiquitous home refers not only to home but also to logical space, including a wide range of out-home personal devices such as mobile phones, PDAs, laptops, car navigators, and office PCs. There are certain connection barriers among the devices, such as the dynamic IP address, NAT. In a home network, various devices coexist in heterogeneous networks, such as IP, IEEE1394, PLC, Bluetooth, ZigBee, UWB, and IrDA, all of which lack interoperability due to their different physical transmission characteristics and protocols. In ubiquitous home where an unrestricted collaboration of the devices is essential to offer services that meet the users' requirements, free interoperability among the devices must be guaranteed. This paper proposes a networking model for interoperability of the heterogeneous devices in a ubiquitous home based on a virtual overlay network which hides the complicated physical network configurations and heterogeneity of the service protocols.

Full-Search Block-Matching Motion Estimation Circuit with Hybrid Architecture for MPEG-4 Encoder (하이브리드 구조를 갖는 MPEG-4 인코더용 전역 탐색 블록 정합 움직임 추정 회로)

  • Shim, Jae-Oh;Lee, Seon-Young;Cho, Kyeong-Soon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.2
    • /
    • pp.85-92
    • /
    • 2009
  • This paper proposes a full-search block-matching motion estimation circuit with hybrid architecture combining systolic arrays and adder trees for an MPEG-4 encoder. The proposed circuit uses systolic arrays for motion estimation with a small number of clock cycles and adder trees to reduce required circuit resources. The interpolation circuit for 1/2 pixel motion estimation consists of six adders, four subtracters and ten registers. We improved the circuit performance by resource sharing and efficient scheduling techniques. We described the motion estimation circuit for integer and 1/2 pixels at RTL in Verilog HDL. The logic-level circuit synthesized by using 130nm standard cell library contains 218,257 gates and can process 94 D1($720{\times}480$) image frames per second.

Delay Optimization Algorithm for the High Speed Operation of FPGAs (FPGA를 고속으로 동작시키기 위한 지연시간 최적화 알고리듬)

  • Choi, Ick-Sung;Lee, Jeong-Hee;Lee, Bhum-Cheol;Kim, Nam-U
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.7
    • /
    • pp.50-57
    • /
    • 2000
  • We propose a logic synthesis algorithm for the design of FPGAs operating at high speed. FPGA is a novel technology that provides programmability in the field. Because of short turnaround time and low manufacturing cost, FPGA has been noticed as an ideal device for system prototyping. Despite these merits, FPGA has drawbacks, namely low integration and long delay time comparing to ASIC. The proposed algorithm partitions a given circuit into subcircuits utilizing a kernel divisor such that the subcircuits can be performed at the same time, hence reducing the delay of the circuit. Experimental results on the MCNC benchmark show that the proposed algorithm is effective by generating circuits having 19.1% les delay on average, when compared to the FlowMap algorithm.

  • PDF