Boolean and multiple-valued functions in combinational logic synthesis
| dc.contributor.author | Dubrova, Elena Vladimirovna | |
| dc.contributor.supervisor | Muzio, Jon C. | |
| dc.date.accessioned | 2017-06-14T20:36:51Z | |
| dc.date.available | 2017-06-14T20:36:51Z | |
| dc.date.copyright | 1997 | en_US |
| dc.date.issued | 2017-06-14 | |
| dc.degree.department | Department of Computer Science | en_US |
| dc.degree.level | Doctor of Philosophy Ph.D. | en_US |
| dc.description.abstract | 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. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/8276 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | Logic circuits | en_US |
| dc.subject | Logic design | en_US |
| dc.title | Boolean and multiple-valued functions in combinational logic synthesis | en_US |
| dc.type | Thesis | en_US |