Back to search

NJIT

The minimum maximal-cube covering approach to switching theory

Abstract

dc:description.abstract

This dissertation is devoted to the construction of a new algebraic structure for the K-map so that algorithms and theorems can be derived for the minimization of Boolean functions and at the same time provide for the manipulation of Boolean functions as freely as one could on the K-map. Computer programs have been included to demonstrate the theory and numerous examples of various complexity have been worked out in the appendices.

Degree

thesis:*
Name thesis:degree_name
Doctor of Engineering Science in Electrical Engineering
Discipline thesis:degree_discipline
Electrical Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Hwang, Yu-tsang Gene
Contributors dc:contributor
  • Robert E. Anderson
  • Kenneth Sohn
  • William Joseph Troop

Subjects

dc:subject × 2

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/dissertations/1254

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Hwang, Yu-tsang Gene. The minimum maximal-cube covering approach to switching theory. https://digitalcommons.njit.edu/dissertations/1254