Novel Algorithms for Fast Statistical Analysis of Scaled Circuits

Novel Algorithms for Fast Statistical Analysis of Scaled Circuits

EnglishPaperback / softbackPrint on demand
Singhee Amith
Springer
EAN: 9789400736870
Print on demand
Delivery on Friday, 21. of August 2026
CZK 2,351
Common price CZK 2,612
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

As VLSI technology moves to the nanometer scale for transistor feature sizes, the impact of manufacturing imperfections result in large variations in the circuit performance. Traditional CAD tools are not well-equipped to handle this scenario, since they do not model this statistical nature of the circuit parameters and performances, or if they do, the existing techniques tend to be over-simplified or intractably slow. Novel Algorithms for Fast Statistical Analysis of Scaled Circuits draws upon ideas for attacking parallel problems in other technical fields, such as computational finance, machine learning and actuarial risk, and synthesizes them with innovative attacks for the problem domain of integrated circuits. The result is a set of novel solutions to problems of efficient statistical analysis of circuits in the nanometer regime.

EAN 9789400736870
ISBN 9400736878
Binding Paperback / softback
Publisher Springer
Publication date March 7, 2012
Pages 195
Language English
Dimensions 235 x 155
Country Netherlands
Readership Professional & Scholarly
Authors Rutenbar, Rob A.; Singhee Amith
Illustrations XV, 195 p.
Edition 2009 ed.
Series Lecture Notes in Electrical Engineering
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.