
Operation of 2x1 MUXes, truth tables of 2x1 MUXes
2x1 MUX circuit is analyzed
The components where MUXes are used are explained. DIP MUX devices are inspected.
4x1 MUX is explained, its operation is illustrated by animation, the truth table of 4x1 MUX is obtained.
Decomposition of Boolean functions is explained. Implementation of Boolean functions using multiplexers is explained.
In this lecture, we solve some problems involving the implementation of Boolean functions with 2x1 MUXes.
In this course, we teach logic circuit design. There is no specific background required for this course. You will learn everything you need to master on the course.
In this course, first number systems and Boolean algebra are explained. The student of this course should learn number systems, especially binary numbers, and Boolean algebra very well since the rest of the subjects lie on these two topics.
We introduce Boolean functions and explain the simplification of Boolean functions using Karnaugh maps and introduce logic gates. Simplification of the Boolean functions is an important concept for the optimized design of logic circuits. Don't forget that every extra gate you use in your non-optimized design means a waste of money and extra energy use and low-speed functioning. For these reasons, optimizing your design is as important as performing a design. The design of combinational circuits is covered in the course. Following the combinational circuit design topic, we explain the design of clocked or synchronous circuits. Then the design of specific logic devices such as registers, counters, and memory units are explained. The student of this course should try to get the design philosophy taught in this course. Students usually are interested in the functioning of the circuits and try to avoid to master on mathematical design concepts, however, without good mathematical design knowledge, one cannot do creative designs.