Chung-Kuan Cheng

Learn More
We present efficient, optimal algorithms for timing optimization by discrete wire sizing and buffer insertion. Our algorithms are able to minimize dynamic power dissipation subject to given timing constraints. In addition, we compute the complete power-delay tradeoff curve for added flexibility. We extend our algorithm to take into account the effect of(More)
We present an ordered tree, O-tree, structure to represent non-slicing floorplans. The O-tree uses only n (2 + lg n) bits for a floorplan of n rectangular blocks. We define an admissible placement as a compacted placement in both x and y direction. For each admissible placement, we can find an O-tree representation. We show that the number of possible(More)
In this paper, a corner block list -- a new efficient topological representation for non-slicing floorplan is proposed with applications to VLSI floorplan and building block placement. Given a corner block list, it takes only linear time to construct the floorplan. Unlike the O-tree structure, which determines the exact floorplan based on given block sizes,(More)
and Applications. I. Pitas. Wiley, 2000, 419 pp, $89.95 (cloth). This book goes beyond theory and techniques to address the underlying algorithms of digital image processing. It provides a complete compilation of algorithms for digital image processing, coding and analysis and includes digital image transform algorithms, edge detection algorithms, and image(More)
and Applications. I. Pitas. Wiley, 2000, 419 pp, $89.95 (cloth). This book goes beyond theory and techniques to address the underlying algorithms of digital image processing. It provides a complete compilation of algorithms for digital image processing, coding and analysis and includes digital image transform algorithms, edge detection algorithms, and image(More)
and Applications. I. Pitas. Wiley, 2000, 419 pp, $89.95 (cloth). This book goes beyond theory and techniques to address the underlying algorithms of digital image processing. It provides a complete compilation of algorithms for digital image processing, coding and analysis and includes digital image transform algorithms, edge detection algorithms, and image(More)
In this paper, we present a two-way partitioning algorithm that significantly improves on the highly unstable results typically obtained from the traditional Kernighan-Lin based algorithms. The algorithm groups highly connected components into clusters and rearranges the clusters into two final subsets with specified sizes. It is known that the grouping(More)
A new constructive placement and partitioning method based on resistive network optimization is proposed. The objective function used is the sum of the squared wire length. The method has the feature which includes fixed modules in the formulation. The overall algorithm comprises the following subprograms: optimization, scaling, relaxation, partitioning and(More)
Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n) complexity, where n is the number of blocks. In this paper, we reduce the complexity of the deterministic algorithm to O(n). Experimental results indicate our algorithm maintains the high(More)