tailieunhanh - Handbook of algorithms for physical design automation part 104

Handbook of Algorithms for Physical Design Automation part 104 provides a detailed overview of VLSI physical design automation, emphasizing state-of-the-art techniques, trends and improvements that have emerged during the previous decade. After a brief introduction to the modern physical design problem, basic algorithmic techniques, and partitioning, the book discusses significant advances in floorplanning representations and describes recent formulations of the floorplanning problem. The text also addresses issues of placement, net layout and optimization, routing multiple signal nets, manufacturability, physical synthesis, special nets, and designing for specialized technologies. It includes a personal perspective from Ralph Otten as he looks back on. | 1012 Index Inverter voltage transfer characteristic and noise margins 680 INVERT-NAND sequence 821 IP block 265-268 IRL see Irreducible realization list Irreducible empty rooms T-junctions 197 types of 198 Irreducible realization list 180 963-964 Island-style FPGA placement 967-968 Iso-dense bias 706 ISPD see International Symposium on Physical Design ISPD 2005 global placements of 301 Itanium microprocessor clock distribution 910 topology 908 deskew buffer architecture of 909 global core H-tree of 908 regional clocks of 909 Iterated dominance IDOM graph 494 Iterated KMB IKMB construction 495 Iterated 1-Steiner I1S heuristic 490-492 empirical performance of 493-494 generalization of 494 graph generalization of 494-495 Iterated Zelikovsky IZEL heuristic 495 Iteration target acceptance rate 316 Iterative floorplanning 153 Iterative partitioning 339 ITRS see International Technology Roadmap for Semiconductors J Jitter arrival time of clock transition 882 K Karush-Kuhn-Tucker KKT condition for optimality 95 kd tree 57-59 67-68 range query algorithm on 59 for set of points on plane 58 Kernighan-Lin heuristic for graph bipartitioning 114-115 K-input LUT K-LUT 943-944 958-960 Kirchhoff boundary condition 701 Krishnamurthy s method 116 see also Partitioning KLFM algorithm 841 K-LUT technology mapping in O KVE 959 KMB algorithm 494 KMB graph Steiner heuristic 518 Kou Markowsky and Berman KMB method 494 Kraftwerk 349 351-352 365-366 370-371 373 437 Kruskal s algorithm 59 79-80 Kuhn-Tucker condition 537 L Lagrange multiplier 436-437 592 Lagrangian decomposition see Lagrangian relaxation Lagrangian function 94-95 Lagrangian relaxation 591 616-617 799 based methodology 475 basic procedure 96 duality function maximization 96-97 method in TDP 440-441 updating of dual parameters 97 Lam s algorithm 314 Lam s theory 315 Laplacian matrix 113 118-120 Large scale integration 139 Last-in-first-out LIFO scheme 116 Latency constrained optimization 666-667 minimization multiple-terminal .

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.