• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.12
• /
• pp.117-124
• /
• 1993

In this paper we propose a new thchnology mapping algorithm for multiplexer-based FPGA's The algorithm consists of three phases` First, it converts the logic functions and the basic logic mocule into BDD's. Second. it covers the logic function with the basic logic modules. Lastly, it reduces the number of basic logic modules used to implement the logic function after going through cell merging procedure. The binate selection is employed to determine the order of input variables of the logic function to constructs the balanced BDD with low level. That enables us to constructs the circuit that has small size and delay time. Technology mapping algorithm of previous work used one basic logic module to implement a two-input or three-input function in logic functions. The algorithm proposed here merges almost all pairs of two-input and three-input functions that occupy one basic logic module. and improves the mapping results. We show the effectiveness of the algorithm by comparing the results of our experiments with those of previous systems.

• Progress in Superconductivity and Cryogenics
• /
• v.14 no.1
• /
• pp.14-19
• /
• 2012

Shimming, active and/or passive, is indispensable for most MR (magnetic resonance) magnets where homogeneous magnetic fields are required within target spaces. Generally, shimming consists of two steps, field mapping and correcting of fields, and they are recursively repeated until the target field homogeneity is reached. Thus, accuracy of the field mapping is crucial for fast and efficient shimming of MR magnets. For an accurate shimming, a "magnetic" center, which is a mathematical origin for harmonic analysis, must be carefully defined, Although the magnetic center is in general identical to the physical center of a magnet, it is not rare that both centers are different particularly in HTS (high temperature superconducting) magnets of which harmonic field errors, especially high orders, are significantly dependent on a location of the magnetic center. This paper presents a new algorithm, based on a field mapping theory with harmonic analysis, to define the best magnetic center of an MR magnet in terms of minimization of pre-shimming field errors. And the proposed algorithm is tested with simulation under gaussian noise environment.

• The KIPS Transactions:PartA
• /
• v.19A no.1
• /
• pp.17-22
• /
• 2012

The demand of high performance processor is soaring due to the extending of mobile and small electronic device market. CGRA(Coarse Grained Reconfigurable Architecture) is the processor satisfying both of performance and low-power demands and a great alternative of ASIC that can be reconfigured. This paper presents a novel low-power mapping algorithm that optimizes the number of used computation resource in the mapping phase by considering data transfer time. Compared with previous mapping algorithm, ours reduce energy consumption by up to 73%, and 56.4% on average.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.599-602
• /
• 2005

This paper utilizing model picture of finished clothes in fashion design field various material (textile fabrics) doing Draping directly can invent new design, and do not produce direction sample or poetic theme width and confirm clothes work to simulation. Also, construct database about model and material image that can confirm Mapping result by real time. Development did the 2.5D Mapping system that used path extraction algorithm, warp algorithm, a lighting extraction and application algorithm in order to implement natural Draping of model picture and material image.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.44-48
• /
• 1998

In this paper proposed Component Synthesis Algorithm(CSA) for mapping described HDL to RT component of given library. CSA transform I/O variables of HDL and relation of operators to control/data flow graph(CDFG) that consists of graph, reduce the size of graph, compute the cost, the bound, and the method that use compatibility graph(CG), and then mapping to component. Component synthesis used branch-and-bound algorithm. The result that synthesis using CSA algorithm was proved that this result and the cost of the manual were indentified.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.154-157
• /
• 2009

High dynamic range image can describe the real world scenes that have a wide range of luminance intensity. To display high dynamic range (HDR) image into conventional displayable devices such as monitors and printers, we proposed the logarithmic based global mapping algorithm that consider the features of image using mapping parameters. Based on characteristics of image, we first modify input luminance values for reproducing perceptually tuned images and then displayable output values are obtained directly. The experimental results show that the proposed algorithm achieves good subjective results while preserving details of image, furthermore proposed algorithm has fast simple and practical structure for implementation.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.295-303
• /
• 2005

Semantic Web and its related technologies have been opening the era of information sharing via Web. In the meantime, there are several huddles to overcome toward the new era and one of the major huddles is information integration issue unless we build and use a single unified but huge ontology which address everything in the world. Particularly in e-business area, information integration problem must be a great concern in search and comparison of products from various internet shopping sites and e-marketplaces. To overcome such an information integration problem, we propose an ontology driven mapping algorithm between heterogeneous product classification and description frameworks. We also perform comparative evaluation of the proposed mapping algorithm against a well-known ontology mapping tool, PROMPT.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.1
• /
• pp.69-81
• /
• 2024

In this paper, we provide certain fixed point results for a generalized 𝛼-nonexpansive mapping, as well as a new iterative algorithm called SRJ-iteration for approximating the fixed point of this class of mappings in the setting of CAT(0) spaces. Furthermore, we establish strong and ∆-convergence theorem for generalized 𝛼-nonexpansive mapping in CAT(0) space. Finally, we present a numerical example to illustrate our main result and then display the efficiency of the proposed algorithm compared to different iterative algorithms in the literature. Our results obtained in this paper improve, extend and unify results of Abbas et al. [10], Thakur et al. [22] and Piri et al. [19].

• Journal of Korea Multimedia Society
• /
• v.25 no.10
• /
• pp.1395-1403
• /
• 2022

Lately, over 4K high definition and high dynamic range (HDR) display devices are popularized, various interpolation and HDR methods have been researched to expand the size and the dynamic range. Since most of the legacy low resolution (LR) images require both an interpolation and a HDR tone mapping methods, the two processes should be subsequently applied. Therefore, the proposed algorithm presents a HDR up-scaling algorithm using undecimated wavelet transform and Retinex method, which transfers a LR image of low dynamic range (LDR) into the high resolution (HR) with HDR. The proposed algorithm consists of an up-scaling scheme increasing the image size and a tone mapping scheme expanding the dynamic range. The up-scaling scheme uses the undecimated version of the simplest Haar wavelet analysis for the 8-directional interpolation and the change region is extracted during the analysis. This region information is utilized in controlling the surround functions' size of the proposed tone mapping using MSRCR, to enhance the pixels of around the edges that are dominant feature of the subjective image quality. As the results, the proposed algorithm can apply an up-scaling and tone mapping processes in accordance with the type of pixel.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.2
• /
• pp.88-99
• /
• 1992

This paper presents an efficient method of mapping Boolean equations to a set of library gates. The proposed system performs technology mapping by graph covering. To select optimal area cover, a new cost function and local area optimization are proposed. Experimental results show that the proposed algorithm produces effective mapping using given library.