A perturbation-aware noise convergence methodology for high frequency microprocessors

Prashant Saxena, Kumar N. Lalgudi, Hans J. Greub, Janet M. Wang-Roveda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We present a practical flow that automates the process of analyzing noise failures and determining and implementing the most appropriate design fixes in high performance designs. For each noise problem, the flow implicitly identifies the most sensitive relevant electrical parameter(s) which it then maps to a physical solution that minimizes design perturbation. Integrated with standard physical synthesis, it was used extensively in a high volume 90 nm multi-GHz microprocessor project.

Original languageEnglish (US)
Title of host publicationProceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005
Pages717-722
Number of pages6
StatePublished - Dec 1 2005
Event2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005 - Shanghai, China
Duration: Jan 18 2005Jan 21 2005

Publication series

NameProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Volume2

Other

Other2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005
CountryChina
CityShanghai
Period1/18/051/21/05

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A perturbation-aware noise convergence methodology for high frequency microprocessors'. Together they form a unique fingerprint.

  • Cite this

    Saxena, P., Lalgudi, K. N., Greub, H. J., & Wang-Roveda, J. M. (2005). A perturbation-aware noise convergence methodology for high frequency microprocessors. In Proceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005 (pp. 717-722). [1466441] (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC; Vol. 2).