Theses and Dissertations

Issuing Body

Mississippi State University

Advisor

Thornton, Mitchell A.

Committee Member

Reese, Robert B.

Committee Member

Little, R. Rainey

Date of Degree

1-1-2002

Document Type

Graduate Thesis - Open Access

Abstract

All discrete function representations become exponential in size in the worst case. Binary decision diagrams have become a common method of representing discrete functions in computer-aided design applications. For many functions, binary decision diagrams do provide compact representations. This work presents a way to represent large decision diagrams as multiple smaller partial binary decision diagrams. In the Boolean domain, each truth table entry consisting of a Boolean value only provides local information about a function at that point in the Boolean space. Partial binary decision diagrams thus result in the loss of information for a portion of the Boolean space. If the function were represented in the spectral domain however, each integer-valued coefficient would contain some global information about the function. This work also explores spectral representations of discrete functions, including the implementation of a method for transforming circuits from netlist representations directly into spectral decision diagrams.

URI

https://hdl.handle.net/11668/20076

Share

COinS