## Automating Logic Transformations With Approximate SPFDs

- Yu-Shen Yang, Subarna Sinha, Andreas G. Veneris, Robert K. Brayton
- IEEE Transactions on Computer-Aided Design of…
- 2011

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… (More)

### Presentations referencing similar topics