• Title/Summary/Keyword: Cost Constraint

Search Result 499, Processing Time 0.033 seconds

An Efficient CPLD Technology Mapping considering Area under Time Constraint (시간 제약 조건하에서 면적을 고려한 효율적인 CPLD 기술 매핑)

  • Kim, Jae-Jin;Kim, Hui-Seok
    • 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.

  • PDF

Multicriteria shape design of a sheet contour in stamping

  • Oujebbour, Fatima-Zahra;Habbal, Abderrahmane;Ellaia, Rachid;Zhao, Ziheng
    • Journal of Computational Design and Engineering
    • /
    • v.1 no.3
    • /
    • pp.187-193
    • /
    • 2014
  • One of the hottest challenges in automotive industry is related to weight reduction in sheet metal forming processes, in order to produce a high quality metal part with minimal material cost. Stamping is the most widely used sheet metal forming process; but its implementation comes with several fabrication flaws such as springback and failure. A global and simple approach to circumvent these unwanted process drawbacks consists in optimizing the initial blank shape with innovative methods. The aim of this paper is to introduce an efficient methodology to deal with complex, computationally expensive multicriteria optimization problems. Our approach is based on the combination of methods to capture the Pareto Front, approximate criteria (to save computational costs) and global optimizers. To illustrate the efficiency, we consider the stamping of an industrial workpiece as test-case. Our approach is applied to the springback and failure criteria. To optimize these two criteria, a global optimization algorithm was chosen. It is the Simulated Annealing algorithm hybridized with the Simultaneous Perturbation Stochastic Approximation in order to gain in time and in precision. The multicriteria problems amounts to the capture of the Pareto Front associated to the two criteria. Normal Boundary Intersection and Normalized Normal Constraint Method are considered for generating a set of Pareto-optimal solutions with the characteristic of uniform distribution of front points. The computational results are compared to those obtained with the well-known Non-dominated Sorting Genetic Algorithm II. The results show that our proposed approach is efficient to deal with the multicriteria shape optimization of highly non-linear mechanical systems.

A SOC Design Methodology using SystemC (SystemC를 이용한 SOC 설계 방법)

  • 홍진석;김주선;배점한
    • Proceedings of the IEEK Conference
    • /
    • 2000.06b
    • /
    • pp.153-156
    • /
    • 2000
  • This paper presents a SOC design methodology using the newly-emerging SystemC. The suggested methodology firstly uses SystemC to define blocks from the previously-developed system level algorithm with internal behavior and interface being separated and validate such a described blocks' functionality when integrated. Next, the partitioning between software and hardware is considered. With software, the interface to hardware is described cycle-accurate and the other internal behavior in conventional ways. With hardware, I/O transactions are refined gradually in several abstraction levels and internal behavior described on a function basis. Once hardware and software have been completed functionally, system performance analysis is performed on the built model with assumed performance factors and influences such decisions regressively as on optimum algorithm selection, partitioning and etc. The analysis then gives constraint information when hardware description undergoes scheduling and fixed-point trans- formation with the help of automatic translation tools or manually. The methodology enables C/C++ program developers and VHDL/Verilog users to migrate quickly to a co-design & co-verification environment and is suitable for SoC development at a low cost.

  • PDF

A study on optimum design of a lightweight mirror (경량화 반사경의 최적설계에 관한 연구)

  • 박강수;박현철;조지현;윤성기;이준호
    • Korean Journal of Optics and Photonics
    • /
    • v.14 no.4
    • /
    • pp.443-448
    • /
    • 2003
  • A study on optimum design of the lightweight mirror of a satellite camera is presented. An optical surface deformation of the lightweight mirror, which is a principal component of the camera system, is an important factor affecting the optical performance of the whole camera system. In this study, optimum design of the lightweight mirror is presented. Total weight of the mirror to reduce the optical surface deformation and the launching cost is used as an objective function. Peak-to-valley value and natural frequency of the mirror are given as constraints to the optimization problem. The sensitivities of the objective function and constraint are calculated by a finite difference method. The optimization procedure is carried out by the commercial optimizer, DOT. As a verification of the optimum design of the mirror, two design examples are treated. In the real application example, the lightweight mirror with 600mm effective diameter is treated. The optimized results with various design variables, which are obtained by considering thickness limitations, are analyzed.

Wireless sensor network analysis of suitable types for fixed facility surveillance (고정설비감시를 위한 무선센서네트워크 형태 분석)

  • Lee, Hoo-Rock;Rhyu, Keel-Soo;Chung, Kyung-Yul
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.1
    • /
    • pp.50-54
    • /
    • 2016
  • A Wireless Sensor Network (WSN) is better than a conventional network for use in construction and Operations and Maintenance (O&M) because of its lower surveillance system cost. However, effective operation of a WSN is often difficult to obtain because the surveillance targets are usually fixed inside the building or underground. Therefore, this environmental constraint should be considered in the design of the WSN plant equipment surveillance system prior to installation. This study employs simulations of WSN-based fixed facility surveillance using the TinyOS TOSSIM simulator to investigate ideal types and setups of the WSN. Simulation target protocols included LEACH and flooding and gossiping protocols. The results show that the hierarchically-structured LEACH protocol demonstrated better load-balancing and efficiency than the flatly-structured flooding and gossiping protocol.

Energy-Aware Self-Stabilizing Distributed Clustering Protocol for Ad Hoc Networks: the case of WSNs

  • Ba, Mandicou;Flauzac, Olivier;Haggar, Bachar Salim;Makhloufi, Rafik;Nolot, Florent;Niang, Ibrahima
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2577-2596
    • /
    • 2013
  • In this paper, we present an Energy-Aware Self-Stabilizing Distributed Clustering protocol based on message-passing model for Ad Hoc networks. The latter does not require any initialization. Starting from an arbitrary configuration, the network converges to a stable state in a finite time. Our contribution is twofold. We firstly give the formal proof that the stabilization is reached after at most n+2 transitions and requires at most $n{\times}log(2n+{\kappa}+3)$ memory space, where n is the number of network nodes and ${\kappa}$ represents the maximum hops number in the clusters. Furthermore, using the OMNeT++ simulator, we perform an evaluation of our approach. Secondly, we propose an adaptation of our solution in the context of Wireless Sensor Networks (WSNs) with energy constraint. We notably show that our protocol can be easily used for constructing clusters according to multiple criteria in the election of cluster-heads, such as nodes' identity, residual energy or degree. We give a comparison under the different election metrics by evaluating their communication cost and energy consumption. Simulation results show that in terms of number of exchanged messages and energy consumption, it is better to use the Highest-ID metric for electing CHs.

Shape optimal design of a 2-D heat transfer system with the isoparametric finite element (等係數 유한요소를 사용한 2차원 열전달시스템의 형상 최적설계)

  • 유영면;박찬우
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.11 no.1
    • /
    • pp.82-87
    • /
    • 1987
  • In this study a method of shape optimization is applied to two dimensional heat transfer system. For this the optimization problem is defined in a functional form including cost, constraints and the system governing equation. Then the material derivative concept in continuum mechanics and the adjoint variable method are employed for the shape design sensitivity analysis. With the sensitivity analysis results, an optimum is sought with the gradient projection optimization algorithm. The two dimensional isoparametric finite elements are used for accurate analysis and sensitivity calculations. The above method is employed to find the boundary shape to achieve a desired temperature distribution along a segment of the boundary subject to the maximum area constraint.

An Analysis on Competition and Ecology of Mobile Platform : Based on the Continuous Usage Intention of Smart-Phone OS Platform (모바일 플랫폼 경쟁과 모바일 생태계에 관한 고찰 : 스마트폰 운영 플랫폼의 지속사용 의도를 중심으로)

  • Lee, Bo-Kyoung;Shim, Seon-Young
    • Journal of Information Technology Services
    • /
    • v.11 no.2
    • /
    • pp.19-47
    • /
    • 2012
  • Contemporary smartphone competition is generally described as the battle between Apple's proprietary platform and Google's open platform. However, this competition is not limited within smartphone adoption itself. User's pre-adoption of one mobile platform via smartphone can be connected to the post-adoption of the same mobile platform based on the other smart devices (e.g. smart pad). In this study, we investigate whether user's preference to a certain platform is persistent over mobile ecology, from the pre-adoption of one smart device to the post-adoption of following devices. For this investigation, we adopt the dual-model as the ground theory, where post-adoption of IT product is explained by both dedication and constraint factors. The empirical testing first evidences that dual model works well as our research model for identifying the reasons of post-adoption. Next, we group our data into two parts in order to compare the switching behavior of iPhone users and Android phone users. iPhone users show much lower switching rate to Android based smart pads, while Android phone users show higher churn rate to iPad (49.3% : 96.3%). Especially, satisfaction showed much stronger effect than switching cost on the continuing intention of existing platform, when the analysis is given to the iPhone user's group. From this result, we can conjecture the relatively stronger loyalty of iPhone users. More managerial implications on the mobile platform strategy are driven.

Precision Analysis of the STOMP(FW) Algorithm According to the Spatial Conceptual Hierarchy (공간 개념 계층에 따른 STOMP(FW) 알고리즘의 정확도 분석)

  • Lee, Yon-Sik;Kim, Young-Ja;Park, Sung-Sook
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.12
    • /
    • pp.5015-5022
    • /
    • 2010
  • Most of the existing pattern mining techniques are capable of searching patterns according to the continuous change of the spatial information of an object but there is no constraint on the spatial information that must be included in the extracted pattern. Thus, the existing techniques are not applicable to the optimal path search between specific nodes or path prediction considering the nodes that a moving object is required to round during a unit time. In this paper, the precision of the path search according to the spatial hierarchy is analyzed using the Spatial-Temporal Optimal Moving Pattern(with Frequency & Weight) (STOPM(FW)) algorithm which searches for the optimal moving path by considering the most frequent pattern and other weighted factors such as time and cost. The result of analysis shows that the database retrieval time is minimized through the reduction of retrieval range applying with the spatial constraints. Also, the optimal moving pattern is efficiently obtained by considering whether the moving pattern is included in each hierarchical spatial scope of the spatial hierarchy or not.

2-Stage Optimal Design and Analysis for Disassembly System with Environmental and Economic Parts Selection Using the Recyclability Evaluation Method

  • Igarashi, Kento;Yamada, Tetsuo;Inoue, Masato
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.1
    • /
    • pp.52-66
    • /
    • 2014
  • Promotion of a closed-loop supply chain requires disassembly systems that recycle end-of-life (EOL) assembled products. To operate the recycling disassembly system, parts selection is environmentally and economically carried out with non-destructive or destructive disassembly, and the recycling rate of the whole EOL product is determined. As the number of disassembled parts increases, the recycling rate basically increases. However, the labor cost also increases and brings lower profit, which is the difference between the recovered material prices and the disassembly costs. On the other hand, since the precedence relationships among disassembly tasks of the product also change with the parts selections, it is also required to optimize allocation of the tasks in designing a disassembly line. In addition, because information is required for such a design, the recycling rate, profit of each part and disassembly task times take precedence among the disassembly tasks. However, it is difficult to obtain that information in advance before collecting the actual EOL product. This study proposes and analyzes an optimal disassembly system design using integer programming with the environmental and economic parts selection (Igarashi et al., 2013), which harmonizes the recycling rate and profit using recyclability evaluation method (REM) developed by Hitachi, Ltd. The first stage involves optimization of environmental and economic parts selection with integer programming with ${\varepsilon}$ constraint, and the second stage involves optimization of the line balancing with integer programming in terms of minimizing the number of stations. The first and second stages are generally and mathematically formulized, and the relationships between them are analyzed in the cases of cell phones, computers and cleaners.