EUR 59,45 + EUR 0,49 de gastos de envío
  • Precio recomendado: EUR 145,59
  • Ahorras: EUR 86,14 (59%)
  • Precio final del producto
Sólo queda(n) 1 en stock.
Vendido y enviado por Pool of Books (We ship worldwide!).
EUR 59,45 + EUR 0,49 de gastos de envío
Compara Precios en Amazon
Añadir a la cesta
EUR 129,50
Envío GRATIS disponible. Ver detalles.
Vendido por: Amazon
¿Tienes uno para vender? Vender en Amazon
Volver atrás Ir adelante
Escuchar Reproduciendo... Interrumpido   Estás escuchando una muestra de la edición de audio Audible.
Más información
Ver las 2 imágenes

Symbolic Analysis and Reduction of VLSI Circuits (Inglés) Tapa dura – 15 dic 2004

Ver los 4 formatos y ediciones Ocultar otros formatos y ediciones
Precio Amazon
Nuevo desde Usado desde
Versión Kindle
Tapa dura
EUR 59,45
EUR 59,00 EUR 85,39
click to open popover

Descripción del producto

Reseña del editor

Symbolic analysis is an intriguing topic in VLSI designs.

The analysis methods are crucial for the applications to the parasitic reduction and analog circuit evaluation. However, analyzing circuits symbolically remains a challenging research issue. Therefore, in this book, we survey the recent results as the progress of on-going works rather than as the solution of the field.

For parasitic reduction, we approximate a huge amount of electrical parameters into a simplified RLC network. This reduction allows us to handle very large integrated circuits with given memory capacity and CPU time. A symbolic analysis approach reduces the circuit according to the network topology. Thus, the designer can maintain the meaning of the original network and perform the analysis hierarchically.

For analog circuit designs, symbolic analysis provides the relation between the tunable parameters and the characteristics of the circuit. The analysis allows us to optimize the circuit behavior.

The book is divided into three parts. Part I touches on the basics of circuit analysis in time domain and in s domain. For an s domain expression, the Taylor's expansion with s approaching infinity is equivalent to the time domain solution after the inverse Laplace transform. On the other hand, the Taylor's expansion when s approaches zero derives the moments of the output responses in time domain.

Part II focuses on the techniques for parasitic reduction.

In Chapter 2, we present the approximation methods to match

the first few moments with reduced circuit orders.

In Chapter 3, we apply the Y-Delta transformation to reduce the dynamic linear network. The method finds the exact values of the low order coefficients of the numerator and denominator of the transfer function and thus matches part of the moments. In Chapter 4, we handle two major issues of the Y-Delta

transformation: common factors in fractional expressions and round-off errors. Chapter 5 explains the stability of the reduced expression, in particular the Ruth-Hurwitz Criterion. We make an effort to describe the proof of the Criterion because the details are omitted in most of the contemporary textbooks. In Chapter 6, we present techniques to synthesize circuits to approximate the reduced expressions after the transformation.

In Part III, we discuss symbolic generation of the determinants and cofactors for the application to analog designs. In Chapter 7, we depict the classical topological analysis approach. In Chapter 8, we describe a determinant decision diagram approach that exploits the sparsity of the matrix to accelerate the computation. In Chapter 9, we take only significant terms when we search through

determinant decision diagram to approximate the solution.

In Chapter 10, we extend the determinant decision diagram

to a hierarchical model. The construction of the modules through the hierarchy is similar to the Y-Delta transformation in the sense that a byproduct of common factors appears in the numerator and denominator. Therefore, we describe the method to prune the common factors.


The IC industry, including digital and analog circuit design houses, electrical design automation software vendors, library and IP providers, and foundries all face grand 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 pushing for integration. The physical effects on the performance and reliability of these systems are becoming more pronounced. Efficient modeling and reduction of both the passive and active circuits is essential for hierarchical and IP-based reuse design paradigms. 

Symbolic Analysis and Reducation 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.

Ver Descripción del producto

No es necesario ningún dispositivo Kindle. Descárgate una de las apps de Kindle gratuitas para comenzar a leer libros Kindle en tu smartphone, tablet u ordenador.

  • Apple
  • Android
  • Windows Phone

Obtén la app gratuita:

Detalles del producto

Opiniones de clientes

No hay opiniones de clientes
Comparte tu opinión con otros clientes

Opiniones de clientes más útiles en 5,0 de 5 estrellas 1 opiniones
Li Yang
5,0 de 5 estrellasexcellent book. well written
9 de marzo de 2007 - Publicado en