Hung-Ming Chen
National Chiao Tung University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Hung-Ming Chen.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems | 2005
Hung-Ming Chen; Li-Da Huang; I-Min Liu; Martin D. F. Wong
With todays advanced integrated circuit manufacturing technology in deep submicron (DSM) environment, we can integrate entire electronic systems on a single system on a chip. However, without careful power supply planning in layout, the design of chips will suffer from local hot spots, insufficient power supply, and signal integrity problems. Postfloorplanning or postroute methodologies in solving power delivery and signal integrity problems have been applied but they will cause a long turnaround time, which adds costly delays to time-to-market. In this paper, we study the problem of simultaneous power supply planning and noise avoidance as early as in the floorplanning stage. We show that the problem of simultaneous power supply planning and noise avoidance can be formulated as a constrained maximum flow problem and present an efficient yet effective heuristic to handle the problem. Experimental results are encouraging. With a slight increase of total wirelength, we achieve almost no static IR (voltage)-drop requirement violation in meeting the current and power demand requirement imposed by the circuit blocks compared with a traditional floorplanner and 45.7% of improvement on a /spl Delta/I noise constraint violation compared with the approach that only considers power supply planning.
international conference on computer aided design | 2011
Yi-Peng Weng; Hung-Ming Chen; Tung-Chieh Chen; Po-Cheng Pan; Chien-Hung Chen; Wei-Zen Chen
This paper presents an analog layout migration methodology to quickly provide multiple layouts while keeping similar or better circuit performance. Unlike previous works that often generate a single layout that has exactly the same topology with the original layout, this new migration algorithm is able to provide results with different aspect ratios. First, various placement constraints, including topology, matching, and symmetry, are extracted from the original layout. The extracted constraints are hierarchically stored into a topology slicing tree. Placement is performed from the bottom tree nodes to the root tree node. In each tree node, multiple placements for the subtree are recorded. All possible placements under the constraints are recorded in the root node. This algorithm has been successfully applied to a variable gain amplifier and a folded cascode operational amplifier migrating from UMC 90nm to UMC 65nm. The experimental results validate that our approach can provide reasonable layouts, even a better result almost in no time.
international symposium on quality electronic design | 2006
Li-Chung Hsu; Hung-Ming Chen
With advanced VLSI manufacturing technology in deep submicron (DSM) regime, we can integrate entire electronic systems on a single chip (SoC). Due to the complexity in SoC design, circuit testability becomes one of the most challenging works. Without careful design in scan cell placement and chain ordering, circuits consume much more power in test mode operation than that in normal functional mode. This elevated testing power may cause problems including overall yield lost and instant circuit damage. In this paper, we present an approach to simultaneously minimizing power and routing cost in scan chain reordering after cell placement. We formulate the problem as a traveling salesman problem (TSP), different cost evaluation from (Bonhomme et al., 2004), (Bonhomme et al., 2003), and apply an efficient heuristic to solve it. The experimental results are encouraging. Compared with a recent result in (Bonhomme et al., 2004), which uses the approach with clustering overhead, we obtain up to 10% average power saving under the same low routing cost Furthermore, we obtain 57% routing cost improvement under the same test power consumption in s9234, one of ISCAS89 benchmarks. We collaborate multiple scan chains architecture with our methodology and obtain good results as well
international symposium on quality electronic design | 2008
Ming-Fang Lai; Hung-Ming Chen
As silicon technology scales, we can integrate more and more circuits on a single chip, which means more I/Os are needed in modern designs. The flip-chip technology which was developed by IBM is better suited for I/O increase than the typical peripheral wire-bond design. One of the most important characteristics of flip-chip designs is that the I/O buffers could be placed anywhere inside a chip, just like core cells. Motivated by [14] in proposing various I/O planning constraints, we develop a block and I/O buffer placement method in wirelength and signal skew optimization (especially for differential pair signals), and power integrity awareness for chip-package codesign. The results have shown that our approach takes care of power integrity and outperforms [12] in weighted performance metrics optimization.
international conference on computer aided design | 2007
Chia-Yi Lin; Hung-Ming Chen
This paper proposes a selective pattern-compression scheme to minimize both test power and test data volume during scan-based testing. The proposed scheme will selectively supply the test patterns either through the compressed scan chain whose scanned values will be decoded to the original scan cells, or directly through the original scan chain using minimum transition filling method. Due to shorter length of a compressed scan chain, the potential switching activities and the required storage bits can be both reduced. Furthermore, the proposed scheme also supports multiple scan chains. The experimental results demonstrate that, with few hardware overhead, the proposed scheme can achieve significant improvement in shift-in power reduction and large amount of test data volume reduction.
international symposium on quality electronic design | 2011
Kuo-Hsuan Meng; Po-Cheng Pan; Hung-Ming Chen
This work presents a synthesis framework for nanometer analog, mixed-signal, and radio-frequency circuit design. Our approach has both the advantages of accuracy and efficiency, accomplished by integrating both circuit simulator and analytic formulation. Through performance space exploration, this work facilitates optimal specification setting and trade-off aspect identification from nanometer technology nodes. The hierarchical global-to-local search process consists of device characterization, mapping from geometry-biasing parameters through circuit-level parameters to performance metrics, and reverse identification of optimal design varaibles with fine-tuning. The nature of hierarchy enables the capability of synthesizing large-scaled design with guarantee of accurate and fast convergence to the global optimum. Also this framework can be utilized to identify the constraints that are critically strict to the overall performance, such that the circuit can be designed to operate close to its limit. A radio-frequency distributed amplifier is synthesized as the demonstration showing that the proposed framework is effective and efficient.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems | 2014
Sean Shih-Ying Liu; Chung-Hung Chang; Hung-Ming Chen; Tsung-Yi Ho
The problem of pin-constrained electrowetting-ondielectric (EWOD) biochips becomes a serious issue to realize complex bio-chemical operations. Due to limited number of control pins and routing resources, additional Printed Circuit Board (PCB) routing layers may be required which potentially raises the fabrication cost. Previous state-of-the-art work has tried to develop a framework that uses a network-flow-based method for broadcast electrodeaddressing EWOD biochips. Nevertheless, greedily merging of electrical pins in previous works is at high risk of producing unroutable design. Routability should have higher priority than pin reduction. While previous works dedicated their effort on pin reduction, we have addressed our attention on routability of broadcast addressing. Experimental results demonstrate that taking routability into consideration can even have higher pin reduction. Viewed in this light, we present ACER, a routability driven clustering algorithm followed by escape routing using integer linear programming that effectively solves both pin merging and routing in broadcast addressing framework. Our proposed algorithm does not greedily focus on pin-reduction. Instead, routability is taken into consideration through agglomerative clustering. Compared to previous state-of-the-art, our proposed algorithm can further reduce required control pins by an average of 13% and route the design using 68% less wirelength.
international conference on computer aided design | 2012
Po-Cheng Pan; Hung-Ming Chen; Yi-Kan Cheng; Jill Liu; Wei-Yi Hu
In this paper, we present a novel configurable analog routing methodology for more efficient analog layout automation. By the help of OpenAccess constraint group format, the technology process rules and analog layout design intention/constraints are unified through schematic level to layout level. In contrast to self-defined constraint format in prior arts, proposed approach manipulates the analog routing characteristic based on the unified constraints. In different circuit hierarchies defined by circuit designers or extracted by existing placement, the hierarchical structure is formed as specific analog layout constraint groups. This work efficiently facilitates analog routing strategy which honors the specific analog constraints. By practicing on an analog functional block of tsmc 40nm SoC design which guarantees to be legalized and satisfies required analog constraints by DRC/LVS and post-layout simulation respectively, the results in wire matching for signal integrity show that the different routing priority generated by our approach can have significant performance impact.
international conference on computer aided design | 2013
Ching-Yu Chin; Po-Cheng Pan; Hung-Ming Chen; Tung-Chieh Chen; Jou-Chun Lin
To strive for better circuit performance on analog design, layout generation heavily relies on experienced analog designers effort. Other than general analog constraints such as symmetry and wire-matching are commonly embraced in many proposed works, analog circuit performance is also sensitive to routing behavior. This paper presents a CDT-based layout extraction to preserve routing behavior of the reference layout. Furthermore, a generalized layout prototyping methodology is proposed based on the layout extraction to achieve routing reuse. The proposed layout prototyping is applied to a variable-gain amplifier and a folded-cascode operational amplifier for both migration and prototypes generation. Experimental results show that our approach effectively reduces design cycle time and simultaneously produces reasonable performance.
international symposium on quality electronic design | 2011
Chang-Cheng Tsai; Tzu-Hen Lin; Shin-Han Tsai; Hung-Ming Chen
Low power demand drives the development of lower power design architectures, among which multiple supply voltage is one of the state-of-the-art techniques to achieve low power. In addition, dynamic voltage frequency scaling and adaptive voltage scaling are popular power saving techniques during chip operation to provide different modes for various performance requirements. It is therefore very challenging to generate a clock tree for different operation modes. This paper proposes several implementations on this important issue, one of which can provide smallest clock latency and minimum clock skew on average of required operation modes in multi-voltage designs.