The subject of this dissertation is the theory of Boolean and multiple-valued functions.
The main areas considered are: functional completeness, canonical forms,
minimization of functions, discrete differences and functional decomposability. The
results obtained are used as a foundation for the development of several new algorithms
for logic synthesis of combinational logic circuits. These include an efficient
algorithm for three-level AND-OR-XOR minimization for Boolean functions, an algorithm
for generating the composition trees for Boolean and multiple-valued functions
in a certain class, and an algorithm for computing a new canonical form of multiple-valued
functions. Several other problems, related to logic synthesis, such as test
generation for combinational logic circuits and synthesis of easily testable circuits are also addressed. Possible directions for future research are discussed. / Graduate
| Identifer | oai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/8276 |
| Date | 14 June 2017 |
| Creators | Dubrova, Elena Vladimirovna |
| Contributors | Muzio, Jon C. |
| Source Sets | University of Victoria |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Rights | Available to the World Wide Web |
Page generated in 0.0024 seconds