Sequential Permissible Functions and their Application to Circuit Optimization

Authors:
Chih-chang Lin;Malgorzata Marek-Sadowska;Kuang-Chien Chen;Mike Tien-Chien Lee
Affiliations:
Electrical and Computer Engineering, Univ. of California, Santa Barbara, CA;Electrical and Computer Engineering, Univ. of California, Santa Barbara, CA;Fujitsu Laboratories of America, 77 Rio Robles, San Jose, CA;Fujitsu Laboratories of America, 77 Rio Robles, San Jose, CA
Venue:
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Year:
1996

Citing 10
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The Transduction Method-Design of Logic Networks Based on Permissible Functions

IEEE Transactions on Computers
Implicit and incremental computation of primes and essential primes of Boolean functions

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Recurrence equations and the optimization of synchronous logic circuits

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Permissible observability relations in FSM networks

DAC '94 Proceedings of the 31st annual Design Automation Conference
Sequential logic optimization by redundancy addition and removal

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
The maximum set of permissible behaviors for FSM networks

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A Structural Approach to State Space Decomposition for Approximate Reachability Analysis

ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors
Incremental methods for FSM traversal

ICCD '95 Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors
Logic optimization of interacting components in synchronous digital systems

Logic optimization of interacting components in synchronous digital systems

Sequential SPFDs

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.