UPC EETAC Bachelor's Degree in Telecommunications Systems and in Network Engineering EEL


Lecture 2

L1.2: Logic gates

P1 analysis AND, OR, NOT, XOR, NOR, NAND, NXOR




Analyse the highlighted Circuit_C proposed in P1 to deduce its truth table.

P1 objective



General combinational circuit symbol:


Step 1

1.3. Logic gates

1.3.1. Symbols Buffer (non-inverter) Inverter (NOT) AND, NAND OR, NOR XOR, NXOR

Standard logic gates: symbols, equations, truth table, product of maxterms and sum of minterms rec. 1, rec. 2. The concept of a logic gate represented in two complementary ways (schematic/symbol/logic diagram and logic equation) and its truth table to describe its specifications or how does it work.



This below is another example on how a NXOR truth table can be realised using up to four different and equivalent equations:

NXOR example

1.3.2. Equations in Boolean algebra, also from this reference: Ercegovac, M., Lang, T., Moreno, J. H., Introduction to digital systems, John Wiley & Sons, 1999, link (chapter 2, lecture viewgraphs).

Boole algebra

And also:             x = (x + y) · (x + y')                x = x · (y + y')

1.3.3. Truth table and canonical forms Sum of minterms. Product of maxterms

1.3.4. Timing diagrams

This reference explains content on logic gates and combinational circuits.

electronic tutorials 

Electrical for you

You can read books on the subject or browse the Internet searching the basic theory on digital electronics. For instance, here there is a series of 14 introductory videos to our subject (Dunn, K., Bluegrass Community and Technical College). Some of the videos also include "pdf" notes and exercises and additional web references.