Verifying inevitability of phase-locking in a charge pump phase lock loop using sum of squares programming

Hafiz Ul Asad, Kevin D. Jones

Research output: Chapter in Book/Report/Conference proceedingConference proceedings published in a bookpeer-review

Abstract

Phase-locking in a charge pump (CP) phase lock loop (PLL) is said to be inevitable if all possible states of the CP PLL eventually converge to the equilibrium where the input and output phases are in lock. We verify this property for a CP PLL using a mixed deductive and bounded verification methodology. This involves a positivity check of polynomial inequalities (which is an NP-Hard problem) so we use the sound but incomplete Sum of Squares (SOS) relaxation algorithm to provide a numerical solution.

Original languageEnglish
Title of host publication2015 52nd ACM/EDAC/IEEE Design Automation Conference, DAC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781450335201
DOIs
Publication statusPublished - 24 Jul 2015
Event52nd ACM/EDAC/IEEE Design Automation Conference, DAC 2015 - San Francisco, United States
Duration: 8 Jun 201512 Jun 2015

Publication series

NameProceedings - Design Automation Conference
Volume2015-July
ISSN (Print)0738-100X

Conference

Conference52nd ACM/EDAC/IEEE Design Automation Conference, DAC 2015
Country/TerritoryUnited States
CitySan Francisco
Period8/06/1512/06/15

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Modeling and Simulation

Fingerprint

Dive into the research topics of 'Verifying inevitability of phase-locking in a charge pump phase lock loop using sum of squares programming'. Together they form a unique fingerprint.

Cite this