About This Chapter
Digital Logic Circuits - Chapter Summary
Work through these lessons on digital logic circuits at your convenience. You'll study propositions, truth tables and values, combinational circuits, Karnaugh maps and the Quine-McCluskey algorithm. These resources are self-paced, so you can take your time as you work through the chapter. You can also go back to review any of the material over again, if needed. To assess your knowledge before moving on, take the lesson quizzes and chapter exam. You should be able to do the following once you finish this chapter:
- Design combinational circuits from specifications
- Detail the different types of basic combinational circuits
- Differentiate between sequential circuits and combinational circuits
- Define flip-flop circuits and counter circuits
- Explain the function of registers and shift registers
- Outline the features of finite state machines
- Utilize steps to design sequence detectors
- Discuss the benefits of asynchronous sequential circuits
- Describe an integrated circuit (IC)
- Provide a definition and examples of digital integrated circuits
- Understand how to use logisim
- Detail the practical applications for sequential circuits and combinational circuits
1. Propositions, Truth Values and Truth Tables
Watch this video lesson and learn what truth values are and what a truth table looks like. Learn how to go from a proposition to its negation and how that affects the truth values and the truth tables.
2. Combinational Circuits & Functions: Construction & Conversion
In this lesson, you will learn the basics of combinational circuits, and the logic behind them. You will learn how to represent them with various methods, and to convert between presentation methods.
3. How to Simplify Logic Functions Using Karnaugh Maps
In this lesson we are going to learn how to use Karnaugh Maps to simplify Boolean logic. The resulting Boolean equation represents a minimized function suitable for implementation.
4. How to Simplify Digital Functions Using the Quine-McCluskey Algorithm
This lesson explains how the Quine-McCluskey algorithm is used to simplify logic functions with 3 or more variables. It also discusses a distinguishing factor in this algorithm that can be automated. There are a lot of websites that use it to simplify logic functions.
5. How to Design Combinational Circuits From Specifications
In this lesson we will design a combinational circuit. We will understand the problem definition, create a truth table and implement it in a design circuit.
6. Basic Combinational Circuits: Types & Examples
In this lesson, we will examine the different types of combinational circuits, like the adder, subtractor, multiplexer, demultiplexer, etc. We will examine their functions, characteristics, logic diagrams, and truth tables.
7. Combinational Circuits vs. Sequential Circuits
In this lesson we will learn some basics of sequential circuits and the main characteristics that differentiate them from combinational circuits. We will address the two main concepts that sequential circuits implement: memory and time. We will also cover the basic aspects of state and clock.
8. Introduction to Logisim: Setup & Overview
In this lesson, you will learn about Logisim, and how you can use it to design and test digital logic circuits. A working example is provided to show the flexibility and ease-of-use of this free software.
9. Using Logisim to Build Half & Full Adders
This lesson introduces Logisim, an educational software tool that students in computer engineering classes can use for designing and experimenting with digital circuits. We cover the installation steps and a number of useful examples.
10. Building an ALU Using Logisim
In this lesson, we will see how to design an ALU (Arithmetic Logic Unit) using Logisim, learn how to add sub-circuits and construct a practical design of a 4-bit ALU.
11. Practical Application for Computer Architecture: Combinational Circuits
In this practical lesson, you will develop the truth table and Karnaugh map for a real-life combinational circuit: a multiplexer (MUX). You will also create the logic gate in Logism and simulate the setup.
Earning College Credit
Did you know… We have over 200 college courses that prepare you to earn credit by exam that is accepted by over 1,500 colleges and universities. You can test out of the first two years of college and save thousands off your degree. Anyone can earn credit-by-exam regardless of age or education level.
To learn more, visit our Earning Credit Page
Transferring credit to the school of your choice
Not sure what college you want to attend yet? Study.com has thousands of articles about every imaginable degree, area of study and career path that can help you find the school that's right for you.
Other chapters within the Computer Science 306: Computer Architecture course
- Introduction to Computer Architecture & Hardware
- Data Representation in Digital Computing Systems
- Arithmetic in Computer Binary
- Boolean Logic Gates & Functions
- Digital Circuit Theory: Sequential Logic Circuits
- How Memory Functions in a Computer
- Instruction Set Architecture
- Input/Output in Computer Architecture
- Parallel Computer Architecture
- Evaluating Computer Performance
- Required Assignments for Computer Science 306