• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.7
• /
• pp.844-850
• /
• 1988

In this paper, the implementation of optical parallel boolean logic gates using two Liquid Crystal TVs is described. Based on theory of polarization modulation, two Liquid Crystal TVs are arranged in tandem and parallel to perform optical logic operations. Experimental results of binary image using two Liquid Crystal TVs are presented.

• Proceedings of the Optical Society of Korea Conference
• /
• 2006.07a
• /
• pp.209-210
• /
• 2006

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.1
• /
• pp.79-85
• /
• 2001

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint(TMFCPLD). This technology mapping algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. This method is for reason to reduce area and improve total run time of circuits by TEMPLA proposed previously. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Initial cost of each node are the number of OR-terms that it have. Among mappable clusters, clusters of which the number of multi-level is least is selected, and the graph is partitioned. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by 62.2% than those of DDMAP. And reduced the number of CLBs by 17.6% than those of TEMPLA, and reduced the number of CLBs by 4.7% than those of TMCPLD. This results will give much efficiency to technology mapping for CPLDs.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.9
• /
• pp.54-58
• /
• 2007

Development of high performance LTPS TFTs contributed to open up new SOP technology with various digital circuits integrated in display panels. This work introduces the current mode logic(CML) gate design method with which one can replace slow CMOS logic gates. The CML inverter exhibited small logic swing, fast response with high power consumption. But the power consumption became compatible with CMOS gates at higher clock speed. Due to small current values in CML, layout area is smaller than the CMOS counterpart even though CML uses larger number of devices. CML exhibited higher noise immunity thanks to its non-inverting and inverting outputs. Multi-input NAND/AND and NOR/OR gates were implemented by the same circuit architecture with different input confirugation. Same holds for MUX and XNOR/XOR CML gates. We concluded that the CML gates can be designed with few simple circuits and they can improve power consumption, chip area, and speed of operation.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.311-323
• /
• 1997

This paper presents a fast fault simulation system for detecting stuck-at faults in mixed-level combinational logic circuits with gale level and switch -level primitives. For a practical fault simulator, the types are not restricted to static switch-level and/or gate-level circuits, but include dynamic switch-level circuits. To efficiently handle the multiple signal contention problems at wired logic elements, we propose a six-valued logic system and its logic calculus which are used together with signal strength information. As a basic algorithm for the fault simulation process, a well -known gate-level parallel pattern single fault propagation(PPSFP) technique is extended to switch-level circuits in order to handle pass-transistor circuits and precharged logic circuits as well as static CMOS circuits. Finally, we demonstrate the efficiency of our system through the experimental results for switch-level ISCAS85 benchmark combinational circuits and various industrial mixed-level circuits.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.1
• /
• pp.39-46
• /
• 2005

We fabricate and analyze fully depleted optical thyristors (DOTs) using quarter wavelength reflector stacks (QWRS). QWRS are employed as bottom mirrors to enhance the emission efficiency as well as the optical sensitivity. In order to analyze their switching characteristics, S-shape nonlinear current-voltage curves are simulated and the reverse full-depletion voltages (Vneg's) of DOTs are obtained as function of semiconductor parameters by using a finite difference method (FDM). The fabricated DOTs show sufficient nonlinear s-shape I-V characteristics and switching voltage changes of these devices with and without bottom mirrors show 1.82 V and 1.52 V, respectively. Compared to a conventional DOT, this device with the bottom mirrors shows about 20％ and 46% enhancement in switching voltage change and spontaneous emission efficiency, respectively.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.6
• /
• pp.9-17
• /
• 1999

In this paper, we propose a new technology mapping algorithm for CPLD under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces delay time and the number of CLBs much more than the existing tools of technology mapping algoritm.

• Journal of IKEEE
• /
• v.6 no.1 s.10
• /
• pp.30-39
• /
• 2002

In this paper, we proposed a new circuit construction method that reduces the number of circuit devices of fuzzy controller. Sasaki had defined a new operator to eliminate the divide circuit comparing with the center of gravity method which often using to design the fuzzy controller. In this paper we obtained the more compacted fuzzy controller's circuit by using the proposed definition of fuzzification and defuzzification than using the Sasaki's method and the fuzzification and defuzzification are reverse operation each other. Using these definitions we exhibit the new design method and circuit structure that can eliminate the bounded product(BP) circuit included in Sasaki's circuit. Using the proposed method to level controlling of the water tank, we verified the fuzzy controller's performance by using existent method and proposed method. As a result that are calculated by using the Proposed fuzzy controller to level controlling of the water tank, total numbers of blocks and devices were decreased. If the number of variables and antecedents are Be11ing larger, this method is more efficient.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.11-18
• /
• 2005

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint. This algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by $62.2\%$ than those of DDMAP. And reduced the number of CLBs by $17.6\%$ than those of TEMPLA.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.3
• /
• pp.35-46
• /
• 1999

In this paper, we propose a new CPLD technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm. a given logic equation is constructed as the DAG type. then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs, run-time to be minimized. Also. after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within Cl.B. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces run-time much more than the TMCPLD.