Zhuxing Zhao, Inst. of Comput. Technol., Acad. Sinica, Beijing, China
Zhongcheng Li, Inst. of Comput. Technol., Acad. Sinica, Beijing, China
Yinghua Min, Inst. of Comput. Technol., Acad. Sinica, Beijing, China
A waveform polynomial for a digital circuit integrates both logic and timing information. It is applicable to design verification and test. This paper introduces a compact and manageable form, BPBDD, to represent and manipulate Boolean process based on BDDs, and shows how to construct a BPBDD representing a waveform polynomial for a given circuit. Experimental results show that BPBDD is capable of handling circuits of middle size efficiently. Although it is more complicated than OBDDs, more information about a circuit is available.
Index Terms:
high level synthesis; waveform polynomial manipulation; digital circuit; design verification and test; binary decision diagram; Boolean process; middle size circuits; timing; logic design; logic synthesis; complexity; directed acyclic graph; data structure; combinational circuit
Citation:
Zhuxing Zhao, Zhongcheng Li, Yinghua Min, "Waveform Polynomial Manipulation Using Bdds," ats, pp.136, Fifth Asian Test Symposium (ATS'96), 1996