Application of Boolean Algebra to the Design of Switching Circuits
A. K. Choudhury
Abstract
A. K. Choudhury
Abstract
Application of Boolean algebra to the logical design of switching circuits is discussed. It is pointed out that for the design of a circuit requiring the minimum number of elements the Boolean function must be minimized by either an algebraic or a graphical method. A graphical method developed at the Institute of Mathematical Machines, Czechoslovakia, for minimizing a Boolean function is described.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Application of Boolean algebra to the logical design of switching circuits is discussed. It is pointed out that for the design of a circuit requiring the minimum number of elements the Boolean function must be minimized by either an algebraic or a graphical method. A graphical method developed at the Institute of Mathematical Machines, Czechoslovakia, for minimizing a Boolean function is described.
Key concepts: Boolean algebra, Boolean function, Boolean circuit, And-inverter graph, Boolean expression, Two-element Boolean algebra, Circuit minimization for Boolean functions, Parity function