CSC 3100 Lecture Notes - Lecture 5: Maurice Karnaugh, Multiplexer
20 Mar 2019
School
Department
Course
Professor
Document Summary
Karnaugh maps are a tabular technique for simplifying boolean functions. Special-purpose logic elements, such as multiplexers, demultiplexers, and tri-state buffers. Programmable logic units can be used to implement user-specified functions. Algebraic manipulation can become difficult when there are many literals. Karnaugh maps can be used to represent the truth table for functions when there are many literals. Karnaugh maps can optimize or minimize functions by observation of the values in the map. Sometimes specific values are undefined, because they can"t occur, such as. Cruise control bit on and transmission in park bit on. System power bit off and fan running bit on. These values can be included to simplify the function. The notation is an x for a don"t care bit. Then, an x can be combined with neighboring ones to reduce the function complexity. Small-scale integration (ssi) available in 14-pin dual-in-line (dil) packages. Medium-scale integration (msi) simple logical functions, such as a 4-bit adder or decoder.
