"Sinopsis" puede pertenecer a otra edición de este libro.
"Sobre este título" puede pertenecer a otra edición de este libro.
Gastos de envío:
GRATIS
A Estados Unidos de America
Descripción Hardcover. Condición: new. Nº de ref. del artículo: 9780792391821
Descripción Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190185705
Descripción Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Nº de ref. del artículo: ria9780792391821_lsuk
Descripción Gebunden. Condición: New. Nº de ref. del artículo: 5971315
Descripción Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The layout of an integrated circuit (lC) is the process of assigning geometric shape, size and position to the components (transistors and connections) used in its fabrication. Since the number of components in modem ICs is enormous, computer aided-design (CAD) programs are required to automate the difficult layout process. Prior CAD methods are inexact or limited in scope, and produce layouts whose area, and consequently manufacturing costs, are larger than necessary. This book addresses the problem of minimizing exactly the layout area of an important class of basic IC structures called CMOS cells. First, we precisely define the possible goals in area minimization for such cells, namely width and height minimization, with allowance for area-reducing reordering of transistors. We reformulate the layout problem in terms of a graph model and develop new graph-theoretic concepts that completely characterize the fundamental area minimization problems for series-parallel and nonseries-parallel circuits. These concepts lead to practical algorithms that solve all the basic layout minimization problems exactly, both for a single cell and for a one-dimensional array of such cells. Although a few of these layout problems have been solved or partially solved previously, we present here the first complete solutions to all the problems of interest. Nº de ref. del artículo: 9780792391821
Descripción Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Nº de ref. del artículo: C9780792391821
Descripción Nº de ref. del artículo: STOCK01551581
Descripción Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The layout of an integrated circuit (lC) is the process of assigning geometric shape, size and position to the components (transistors and connections) used in its fabrication. Since the number of components in modem ICs is enormous, computer aided-design (CAD) programs are required to automate the difficult layout process. Prior CAD methods are inexact or limited in scope, and produce layouts whose area, and consequently manufacturing costs, are larger than necessary. This book addresses the problem of minimizing exactly the layout area of an important class of basic IC structures called CMOS cells. First, we precisely define the possible goals in area minimization for such cells, namely width and height minimization, with allowance for area-reducing reordering of transistors. We reformulate the layout problem in terms of a graph model and develop new graph-theoretic concepts that completely characterize the fundamental area minimization problems for series-parallel and nonseries-parallel circuits. These concepts lead to practical algorithms that solve all the basic layout minimization problems exactly, both for a single cell and for a one-dimensional array of such cells. Although a few of these layout problems have been solved or partially solved previously, we present here the first complete solutions to all the problems of interest. 188 pp. Englisch. Nº de ref. del artículo: 9780792391821