ECE124 Study Guide - Sequential Circuits, Sequential Logic, Clock Signal

• School: University of Waterloo
• Department: Electrical and Computer Engineering
• Course: ECE124
• Professor: Michael Ibrahim

Document Summary

We use the binary system for virtually all computations, and as such rely heavily on boolean logic. Since a value represented in binary contains only 1s and 0s, we can easily relate this to boolean algebra, which has only trues and falses. Truth tables are a method to de ne binary / logic functions. A truth table lists the values of a function for all possible input combinations. There are three main operators: and, or, and not. Table 1: and (denoted by multiplication) x y. Table 2: or (denoted by addition) x y. We can write logic functions as equations, using these denotations. Table 3: not (denoted by exclamation marks, negations, overlines, and primes) x. For example f = !x!y + xy = x y + x y is x y. Note the following transformation from the truth table to the equation form f = ! (x + y xy) (x + y) !xy (x + y) + xy.