Waveform polynomial manipulation using BDDs

Author

Zhao, Zhuxing ; Li, Zhongcheng ; Min, Yinghua

Author_Institution

Inst. of Comput. Technol., Acad. Sinica, Beijing, China

fYear

1996

Firstpage

136

Lastpage

141

Abstract

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

Keywords

Boolean functions; automatic testing; circuit analysis computing; combinational circuits; computational complexity; data flow graphs; design for testability; formal verification; high level synthesis; logic partitioning; logic testing; polynomials; symbol manipulation; timing; Boolean process; binary decision diagram; combinational circuit; complexity; data structure; design verification and test; digital circuit; directed acyclic graph; logic design; logic synthesis; middle size circuits; timing; waveform polynomial manipulation; Boolean functions; Circuits; Data structures; Delay; Polynomials; Wires;

fLanguage

English

Publisher

ieee

Conference_Titel

Test Symposium, 1996., Proceedings of the Fifth Asian

Conference_Location

Hsinchu

ISSN

1085-7735

Print_ISBN

0-8186-7478-4

Type

conf

DOI

10.1109/ATS.1996.555150

Filename

555150