Share
symbolic analysis and reduction of vlsi circuits
Zhanhai Qin
(Author)
·
Chung-Kuan Cheng
(Author)
·
Springer
· Paperback
symbolic analysis and reduction of vlsi circuits - Qin, Zhanhai ; Cheng, Chung-Kuan
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My Wishlists
Origin: U.S.A.
(Import costs included in the price)
It will be shipped from our warehouse between
Friday, July 12 and
Friday, July 19.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.
Synopsis "symbolic analysis and reduction of vlsi circuits"
The IC industry, including digital and analog circuit design houses, electrical design automation software vendors, library and IP providers face significant challenges in designing nanometer VLSI systems. The design productivity gap between nanometer VLSI technologies and today's design capabilities mainly comes from the exponentially growing complexity of VLSI systems due to relentless pressures for higher integration. The physical effects on the performance and reliability of these systems are becoming more pronounced. So efficient modelling and reduction of both the passive and active circuits is essential for hierarchical and IP-based reuse design paradigms. Symbolic Analysis and Reduction of VLSI Circuits presents the symbolic approach to the modeling and reduction of both the passive parasitic linear networks and active analog circuits. It reviews classic symbolic analysis methods and presents state-of-art developments for interconnect reduction and the behavioral modeling of active analog circuits. The text includes the most updated discoveries such as Y-Delta transformation and DDD-graph symbolic representation, which allow analysis and modeling of much larger circuitry than ever before.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
