Solution of switching equations based on a tabular algebra

Author

Trabado, Pablo P. ; Lloris-Ruíz, Antonio ; Ortega-Lopera, Julio

Author_Institution

Dept. de Ingenieria Electromecanica, Murcia Univ., Spain

Volume

42

Issue

5

fYear

1993

fDate

5/1/1993 12:00:00 AM

Firstpage

591

Lastpage

596

Abstract

Several problems in switching theory such as automatic test pattern generation, can be exactly and elegantly investigated by using switching equations. An efficient tabular method is presented to solve these switching equations. The solutions of a given equation are compacted into a table, and a Boolean algebra is defined for these tables. The proposed procedure is based on the use of this Boolean algebra. The compactness and simplicity of the method are outstanding, and it is straightforward to implement for computer processing. The complexity of the procedure is computed, and some experimental results for a set of benchmark equations are provided in order to point out the effectiveness of this method

Keywords

Boolean algebra; computational complexity; switching theory; Boolean algebra; automatic test pattern generation; benchmark equations; complexity; computer processing; switching equations; switching theory; tabular method; Automatic test pattern generation; Benchmark testing; Boolean algebra; Calculus; Circuit testing; Combinational circuits; Difference equations; Differential algebraic equations; Digital circuits; Test pattern generators;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.223678

Filename

223678