Simplification of multiple-output Boolean functions using an extension of the directed search algorithm /
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | Thesis Book |
| Language: | English |
| Published: |
1980.
|
| Subjects: | |
| Online Access: | Link to ProQuest copy Link to OAKTrust copy ProQuest, Abstract |
| Abstract: | The approach to minimization of multiple-output combinational systems considered in this study is based on the directed search algorithm that was designed for single-output system. Here the directed search algorithm is extended to minimize multiple-output systems. Unlike most minimization techniques, the algorithm in this study does not identify and select implicants in two separate operations, but rather, it identifies and selects implicants in a single operation. |
|---|---|
| Item Description: | "Major subject: Computing Science." Typescript (photocopy). Vita. |
| Physical Description: | vii, 77 leaves : graphs ; 29 cm |
| Bibliography: | Includes bibliographical references (leaves 50-52). |