By Topic

Using LCSS algorithm for circuit level verification of analog designs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Narayanan, R. ; Dept. of ECE, Concordia Univ. Montreal, Montreal, QC, Canada ; Daghar, A. ; Zaki, M. ; Tahar, S.

This paper relies on the longest closest subsequence (LCSS), a variant of the longest common subsequence (LCS), to account for process variation and mismatch in analog circuits. At circuit level, the effect of mismatch and process variation that results in offsets is analyzed by performing parametric and statistical techniques and then applying LCSS to estimate the probability of closest matching. The acceptance/rejection of a circuit is done using bounded hypothesis testing. The approach is illustrated on a Rambus ring oscillator circuit for a 90nm fabrication process. Advantages of the proposed methods are robustness and flexibility to account for a wide range of variations.

Published in:

New Circuits and Systems Conference (NEWCAS), 2012 IEEE 10th International

Date of Conference:

17-20 June 2012