Floorplanning of memory ICs: Routing complexity vs. yield

被引:0
|
作者
Koren, I [1 ]
Koren, Z [1 ]
机构
[1] Univ Massachusetts, Dept Elect & Comp Engn, Amherst, MA 01003 USA
关键词
floorplanning; memory; redundancy; yield; routing complexity;
D O I
10.1117/12.346926
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
It has recently been shown that for very large chips, especially those with some incorporated redundancy, the chip's floorplan may affect its yield. When selecting a floorplan, the designer should, therefore, consider the expected yield in addition to the traditional objectives such as area, performance, and routing complexity. This paper studies the two seemingly unrelated objectives of routing complexity minimization and yield maximization, and justifies the need for a trade-off analysis when determining the floorplan. We will focus on the analysis of large memory ICs with redundant modules, for which several alternative floorplans may exist.
引用
收藏
页码:297 / 304
页数:8
相关论文
共 50 条
  • [31] Dynamic vs. Oblivious Routing in Network Design
    Navin Goyal
    Neil Olver
    F. Bruce Shepherd
    Algorithmica, 2011, 61 : 161 - 173
  • [32] Stability vs. optimality in selfish ring routing
    Bo Chen
    Xujin Chen
    Jie Hu
    Acta Mathematica Sinica, English Series, 2014, 30 : 767 - 784
  • [33] On P vs. NP and Geometric Complexity Theory
    Mulmuley, Ketan D.
    JOURNAL OF THE ACM, 2011, 58 (02)
  • [34] Chaos: Algorithmic complexity vs. dynamical instability
    Batterman, RW
    LAW AND PREDICTION IN THE LIGHT OF CHAOS RESEARCH, 1996, 473 : 211 - 235
  • [35] Polynomial degree vs. quantum query complexity
    Ambainis, A
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2006, 72 (02) : 220 - 238
  • [36] Polynomial degree vs. quantum query complexity
    Ambainis, A
    44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 230 - 239
  • [37] Accuracy vs. complexity: OPC solutions and tradeoffs
    Balasinski, A
    Iandolo, W
    Banachowicz, B
    Staud, W
    Ma, M
    Sweis, J
    19TH EUROPEAN CONFERENCE ON MASK TECHNOLOGY FOR INTEGRATED CIRCUITS AND MICROCOMPONENTS, 2003, 5148 : 32 - 41
  • [38] Complexity vs. unity in unilateral spatial neglect
    Rode, G.
    Fourtassi, M.
    Pagliari, C.
    Pisella, L.
    Rossetti, Y.
    REVUE NEUROLOGIQUE, 2017, 173 (7-8) : 440 - 450
  • [39] Theoretical vs. practical complexity: The case of UML
    Siau, K
    Erickson, J
    Lee, L
    JOURNAL OF DATABASE MANAGEMENT, 2005, 16 (03) : 40 - 57
  • [40] Entropy vs. Majorization: What Determines Complexity?
    Seitz, William
    Kirwan, A. D., Jr.
    ENTROPY, 2014, 16 (07): : 3793 - 3807