bokomslag VLSI Physical Design: From Graph Partitioning to Timing Closure
Data & IT

VLSI Physical Design: From Graph Partitioning to Timing Closure

Andrew B Kahng Jens Lienig Igor L Markov Jin Hu

Pocket

1209:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-12 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

Andra format:

  • 310 sidor
  • 2014
Design and optimization of integrated circuits are essential to the creation of new semiconductor chips, and physical optimizations are becoming more prominent as a result of semiconductor scaling. Modern chip design has become so complex that it is largely performed by specialized software, which is frequently updated to address advances in semiconductor technologies and increased problem complexities. A user of such software needs a high-level understanding of the underlying mathematical models and algorithms. On the other hand, a developer of such software must have a keen understanding of computer science aspects, including algorithmic performance bottlenecks and how various algorithms operate and interact. "VLSI Physical Design: From Graph Partitioning to Timing Closure" introduces and compares algorithms that are used during the physical design phase of integrated-circuit design, wherein a geometric chip layout is produced starting from an abstract circuit design. The emphasis is on essential and fundamental techniques, ranging from hypergraph partitioning and circuit placement to timing closure.
  • Författare: Andrew B Kahng, Jens Lienig, Igor L Markov, Jin Hu
  • Format: Pocket/Paperback
  • ISBN: 9789400790209
  • Språk: Engelska
  • Antal sidor: 310
  • Utgivningsdatum: 2014-10-15
  • Förlag: Springer