By Topic

Sequential permissible functions and their application to circuit optimization

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)
Chih-Chang Lin ; Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA ; Kuang-Chien Chen ; Marek-Sadowska, M. ; Lee, M.T.-C.

For sequential circuits the implementation freedom represented by combinational permissible functions (CPFs) and un-reachable states don't cares is not complete. We extend the concept of permissible functions to sequential circuits and introduce the sequential permissible functions (SPFs) to represent the complete freedom associated with a gate. We also study and compare the relationship between CPFs and SPFs. In general, the computation of the SPFs is more expensive than the computation of CPFs. We propose an algorithm that computes SPFs implicitly and is based on the well-known state traversal approach. The computed SPFs are used for sequential circuit optimization

Published in:

European Design and Test Conference, 1996. ED&TC 96. Proceedings

Date of Conference:

11-14 Mar 1996