Académique Documents
Professionnel Documents
Culture Documents
Farag
Outline
Boolean Algebra Gates Combinational Circuits
Simplifications of Boolean Functions Multiplexers, Decoders, PLA, ROM, Adders
Sequential Circuits
Flip-Flops Registers Counters
2
Boolean Algebra
Similar to traditional algebra but it defines a set of logical operations and variables _ Basic operations: AND, OR, NOT (., +, ) These operations are defined by their truth tables Other operations can be derived from the basic ones. Ex: NAND, NOR, XOR, XNOR
Gates
To implement any logic function we need a functionally complete set of gates. Ex (AND, OR, NOT), (AND, NOT), (OR, NOT) (NAND), (NOR) How to implement all basic functions by NAND?? Examine its truth table. Same for NOR From manufacturing point of view, using only one type of gates to implement the circuit is very advantageous. Why? Regular -> Simple -> easy to design -> cheap Gates are the basic building blocks of all digital systems. They are implemented using electronics components (transistors, diodes, resistors, etc.) Different families are TTL, CMOS, ECL, etc. Not our problem
Problem: algebraic rules depend mainly upon observation & experience A more systematic way to simplify digital logic expressions is the use of karnaugh maps
7
Some input combinations shall not occur and in this situation we call the outputs, do not care conditions These ds can be used as either 1 or 0 Example: designing an incrementer for a BCD number, see Table 4 and Figure 10 in the following slide
8
Exercise: Design a 4-bit combinational circuit 2s complementer (The output generates the 2s complement of the input binary number)
9
10
11
13
14
15
18
20
22