Logic gates and logic circuits are the foundation of digital systems. At the most fundamental level complex systems such as flip-flops, bistables, counters and adders are all made from logic gates. This lesson is about logic gates themselves, how to describe systems of logic gates using truth tables and boolean algebra, how to design logic circuits to perform a particular task and how to do all of this with just one type of logic gate. The lesson starts with an introduction to some of the concpets of digital systems.
Reading: Introduction to logic circuits. Read about different types of logic circuit and appreciate the difference between combinational and synchronous logic. Consider carefully what is meant by analogue and digital signals and understand that a Logic 1 represents a voltage close to the supply voltage and Logic 0 represents a voltage close to zero volts. Complete the reading in this section by looking at push buttons as inputs and understand that a pull up or pull down resistor is always required.
Reading: All about Logic Gates. Learn the symbol for each logic gate and the associated truth table. Make sure to understand why the logic gates are named as they are so that it is easier to remember their function. Draw out each of the logic gates and the truth table from memory.
Reading: Consider carefully each of the four examples that show how to use intermediate columns to complete a truth table for a circuit containing several different logic gates. Make sure to understand the general principle rather than remembering specific circuit details.
Video (6 min): The Interactive White Board video works through an example of a complex logic circuit built from different logic gates. Watch the video and relate the techniques used to your previous reading.
Reading: Using NAND gates to build any other logic gate has many advantages including making circuits easier to build. Work through the NAND gate equivalent for each different logic gate and try to learn the equivalent circuits. Finally, work through the example circuit where three different logic gates in a circuit are all replaced by their NAND gate equivalents.
Video (11 min): An Interactive White Board video in two parts. The first half looks at each logic gate and considers the NAND gate equivalent. The second half of the video looks at an example circuit which is simplified using NAND gates.
Reading: Complete the work on logic by reading about Boolean algebra. It is important to be able to use Boolean expressions to describe logic circuits and truth tables. The Boolean identities are also useful and help to develop an understanding of the logic gates studied earlier.
Exercises: Complete the exercises about logic circuits.
Review your learning by working through the presentations or notes which summarise the website content.
Presentation: Powerpoint download. Introduction to logic circuits.
Presentation: Powerpoint download. All the different logic gates and their corresponding truth tables.
Presentation: Powerpoint download. Analysis of more complex logic circuits made from multiple logic gates.
Presentation: Powerpoint download. NAND gate equivalent logic circuits.
Presentation: Powerpoint download. Introduction to Boolean algebra.
Notes: PDF download. Introduction to logic circuits, digital and analogue signals, combinational and sequential logic circuits. Overview of logic gates, their associated truth tables and how to analyse complex logic circuits.
Notes: PDF download. Using NAND gate equivalent circuits to simplify complex logic circuits.
Notes: PDF download. Introduction to Boolean Algebra.
Complete either the questions (pdf download) OR the on-line quiz. They are the same questions.
Questions: PDF download. Questions about basic logic circuits.
Questions: PDF download. Questions about NAND equivalent circuits and Boolean expressions.
Quiz: Interactive Quiz about basic logic circuits.
Quiz: Interactive Quiz about NAND equivalent circuits and Boolean expressions.
I can:
© Paul Nicholls
May 2021
Electronics Resources by Paul Nicholls is licensed under a Creative Commons Attribution 4.0 International License.
