• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.2 s.40
• /
• pp.43-49
• /
• 2007

In this study, a GIS spatial analysis method adopted fuzzy concept was introduced and land suitability analysis of waste landfill were conducted through this method. Previous studies conducted site evaluation and land suitability analysis by appling spatial overlay of conventional GIS that based on the boolean logic of crisp set. However these method can not consider the uncertainty of spatial data and the incongruity of data classification criteria, because these method handle spatial data based on the boolean logic of crisp set. As not provided trustable analysis result, conventional GIS spatial overlay method lacks opportunity for expanding use in reality. This study selected waste landfill as facility for analysis and applied fuzzy spatial analysis method as an objective approach. In the concrete contents of study, a series process with regard to the definition procedure of membership function for continuous data and the fuzzy input value generation of spatial data for fuzzy analysis is established. As a result, in this study we proposed a method that derive parameters for deciding the membership function of spatial data by considering the criterion of data classification and factor selection for land suitability analysis of waste landfill.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.4 no.1
• /
• pp.34-46
• /
• 2001

The Boolean logic analysis method using GIS as a spatial decision support system(SDSS) contains two problems. One is losing a lots of informations in analysis process, the other is unable to reflect of different weights between analysis items. The purpose of this study is to provide a new decision-making model for site analysis, that provides a rational and systemic way using fuzzy sets theory and analytic hierarchy process(AHP) theory. According to this study of technopark in Pohang, Boolean logic method did not reflect the influence of the differently weighted items and selected only 8.0% to 16.1% of the area for suitable sites for residence, commercial/research, park/green uses. The fuzzy sets theory and AHP theory method were able to reflect the influence of differently weighted items and selected 32.9% to 37.4% of the area for the best sites, and also provided more other kinds of informations. The results of this study show that GIS system using fuzzy sets theory and AHP proess method provides a more flexible and objective solutions for site analysis.

• 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 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.