Thumbnail
Access Restriction
Subscribed

Author Pileggi, Larry ♦ Yaldiz, Soner ♦ Li, Xin ♦ Althoff, Matthias ♦ Rajhans, Akshay ♦ Krogh, Bruce H.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract We present a scalable and formal technique to verify locking time and stability for charge-pump phase-locked loops (PLLs). In contrast to the traditional simulation approach that only validates the PLL at a given operation condition, our proposed technique formally verified the PLL at all possible operation conditions. The dynamics of the PLL is described by a hybrid automaton, which incorporates the differential equations of the analog circuit elements as well as the switching logic of the digital circuit elements. Existing methods for computing reachable sets for hybrid automata cannot be used to verify the PLL model due to the large number of cycles required for locking. We develop a new method for computing effective overapproximations of the sets of states reached on each cycle by using uncertain parameters in a discrete-time model to represent the range of possible switching times, a technique we call continuization. Using this new method for reachability analysis, it is possible to verify locking specifications for a charge-pump PLL design for all possible initial states and parameter values in time comparable to the time required for a few simulation runs of the same behavioral model.
Description Affiliation: Intel Corporation, Hillsboro, OR (Yaldiz, Soner) || Carnegie Mellon University, Pittsburgh, PA (Rajhans, Akshay; Krogh, Bruce H.; Li, Xin; Pileggi, Larry) || Ilmenau University of Technology, Ilmenau, Germany (Althoff, Matthias)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 56
Issue Number 10
Page Count 8
Starting Page 97
Ending Page 104


Open content in new tab

   Open content in new tab
Source: ACM Digital Library