• DocumentCode
    500943
  • Title

    Double patterning lithography friendly detailed routing with redundant via consideration

  • Author

    Yuan, Kun ; Lu, Katrina ; Pan, David Z.

  • Author_Institution
    ECE Dept., Univ. of Texas at Austin, Austin, TX, USA
  • fYear
    2009
  • fDate
    26-31 July 2009
  • Firstpage
    63
  • Lastpage
    66
  • Abstract
    In double patterning lithography (DPL), coloring conflict and stitch minimization are the two main challenges. Post layout decomposition algorithm may not be enough to achieve high quality solution for DPL-unfriendly designs, due to complex 2D patterns in lower metal layers. Therefore, DPL-friendliness is needed at routing stage. Another key yield improvement technique is redundant via insertion. However, this would increase the complexity in DPL-compliance. To make designs manufacturable in DPL, we should not insert a redundant via if it results in coloring conflict. This paper is the first work to consider DPL and redundant via together. We have developed two algorithms, post-routing DPL-aware insertion and DPL-friendly routing with redundant via consideration to take into account redundant via DPL-compliance. Experimental results show that, compared to a DPL-aware optimization flow without redundant via consideration, we can improve insertion rate by 43% while still achieving zero coloring conflicts. Moreover, we can reduce the number of vias and stitches by 9% and 17% respectively.
  • Keywords
    lithography; network routing; coloring conflict; double patterning lithography-friendly routing; lower metal layers; post layout decomposition algorithm; post-routing double patterning lithography-aware insertion; stitch minimization; Algorithm design and analysis; Hardware; Lithography; Manufacturing; Page description languages; Routing; Solids; Detailed Routing; Double Patterning; Redundant Via;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference, 2009. DAC '09. 46th ACM/IEEE
  • Conference_Location
    San Francisco, CA
  • ISSN
    0738-100X
  • Print_ISBN
    978-1-6055-8497-3
  • Type

    conf

  • Filename
    5227201