Sequential SPFDs

SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combinational networks [2]. We introduce the concept of sequential SPFDs and provide an algorithm to compute them based on a partition of the state bits. The SPFDs of each component in the partition are used to generate equivalence classes of states. We provide a formal relation between the resulting state classification and the equivalence classes produced by classical state minimization of completely specified machines [6]. The SPFDs associated with the state bits can be applied for re-encoding the state space. For this, we give an algorithm to re-synthesize the sequential circuit using sequential SPFDs and the new state re-encoding.

• Type: Conference
• Year: 2001
• Where: ICCAD
• Authors: Subarnarekha Sinha, Andreas Kuehlmann, Robert K. Brayton
• Keywords: Classical State Minimization, Equivalence Classes, Hardware, ICCAD 2001, State Bits