Recursive Realizations of Combinational Circuits



In this chapter we illustrate some applications of Boolean reasoning in the design of multiple-output switching circuits. The stimulus applied to the circuit shown in Figure 9.1 is an input-vector, X = (x1, x2,..., x m ) , of binary signals; its response is an output-vector, Z = (z1, z2,..., z n ), of binary signals. We assume the circuit to be combinational, by which we mean that the value of Z at any time is a function of the value of X at that time. A sequential circuit, on the other hand, is one for which the value of Z may depend on past values of X as well as on its present value.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1990

Authors and Affiliations

  1. 1.Air Force Institute of TechnologyUSA

Personalised recommendations