Educypediathe educational encyclopedia
Electronics-theory
Analog
Audio - acoustics
Audio - electronics
Audio - loudspeakers
Components-active
Components-passive
Component - sensors
Digital - electronics
Digital - I2C - I2S
Digital - Programming
Electricity High Voltage
Electricity - machines
Electricity - theory
General overview
Miscellaneous
Optics
Power control systems
Power electronics
RF - antennas
RF - antenna - WLAN
RF - communication
RF - radio - tuning
Telephony
Tubes
TV-video-DVD
 
Utilities - tools
Animations & applets
Application notes
Cabling
Calculators
Circuits
Databank - tables
Datasheets
Measurement
Repair
Software - electronics
 
Local sitemap
Sitemap

  
 

Digital logic and Boolean algebra

Digital logic is the branch of electronics concerned with circuits that operate on discrete signals, usually represented as two states written as 0 and 1, or low and high voltage. The basic building blocks are logic gates: AND, OR and NOT, together with the derived gates NAND, NOR, exclusive-OR (XOR) and exclusive-NOR (XNOR). Each gate produces an output that depends only on the present combination of its inputs, behaviour that can be described completely by a truth table.

The mathematics behind these circuits is Boolean algebra, formalised by George Boole. It treats variables that take only the values true and false and defines operations corresponding to AND, OR and NOT. A small set of identities — including the commutative, associative and distributive laws — lets a designer manipulate logic expressions. De Morgan's laws are particularly useful: they state that the complement of an AND equals the OR of the complements, and the complement of an OR equals the AND of the complements. This allows any circuit to be rebuilt using only NAND or only NOR gates.

Because a function can be written in many equivalent forms, minimisation reduces the number of gates and inputs needed. The Karnaugh map is a graphical method that arranges a truth table so that adjacent cells differ in a single variable; grouping neighbouring 1s lets common terms be cancelled by inspection. Larger problems use algebraic methods or computer tools. Combinational logic built this way underlies adders, multiplexers, decoders and the address logic of memory devices such as random-access memory.

Frequently asked questions

What are De Morgan's laws used for?
They convert between AND and OR forms by complementing terms, which lets a circuit be implemented entirely with NAND or NOR gates and helps simplify expressions.
What does a Karnaugh map do?
It is a visual way to minimise a Boolean function. Adjacent cells differ by one variable, so grouping 1s reveals terms that can be combined, reducing the gate count.
Why are NAND and NOR called universal gates?
Any logic function can be built from NAND gates alone or NOR gates alone, so a single gate type can implement an entire design.





Digital logic and logic gates 
Algèbre de Boole en Français
Basic logic gates AND, NAND, OR, NOR, XNOR, EXOR
Booleaanse algebra Booleaanse algebra, minimalisatie met de Booleaanse vergelijkingen, in Dutch
Boolean algebra Boolean Expressions and Functions, Boolean Operators, Boolean Identities, Boolean Functions, Simplification of Boolean Functions, pdf file
Boolean algebra pdf file
Boolean algebra pdf file
Boolean algebra Boolean algebra, pdf file
Boolean algebra and digital logic Boolean algebra and digital logic, pdf file
Canonical forms and logic minimization
Canonical forms and Karnaugh maps pdf file
Canonical forms and logic minimization canonical forms and logic minimization, ppt file
Canonical forms and Karnaugh maps pdf file
Digital logic digital logic, pdf file
Digital logic Boolean algebra, Boolean variables, Boolean functions, theorems of Boolean algebra, De Morgan's Laws in terms of gates Boolean functions and digital circuits, NAND and NOR, alternative logic gate representations, canonical forms simplification and implementation of Boolean functions, Karnaugh maps
Digital logic, the basics pdf file
Educypedia stolen page
Finite State Machine Design Finite State Machine Design, ppt file
Finite State Machine Optimization Finite State Machine Optimization, ppt file
Fundamentals of digital logic AND, NAND, OR, NOR, XNOR, EXOR, Morgan, digital logic, pdf file
Karnaugh kaarten Karnaugh kaarten, vereenvoudigen van logische vergelijkingen, in Dutch, pdf file
Karnaugh maps Karnaugh maps
Karnaugh maps rules of simplification
Karnaugh maps applications, ppt file
Karnaugh maps and logic optimization Karnaugh maps and logic optimization, how to use Karnaugh maps to derive minimal sum of products and product of sums expressions, pdf file
Logic gates ppt file
Logic gates AND, NAND, OR, NOR, XNOR, EXOR, adders
Logic miminimization algorithms ppt file
Logic Synthesis Optimizing Boolean expressions, Read-Only Memories (ROMs), Boolean Minimization, Karnaugh Maps, pdf file
Méthode d'Huffman Huffman coding procedure, en Français, pdf file
Quine-McCluskey method Quine-McCluskey method, pdf file
Quine-McCluskey method Quine-McCluskey method, pdf file
Quine-McCluskey method
Quine McCluskey Minimization ppt file
Quine-McCluskey minimisation algorithm the Quine-McCluskey method (which is also known as the "tabular method") is particularly useful when minimising functions that have a large number of variables, e.g. the six-variable functions
Simplification of Boolean functions pdf file
Simplification of switching equations pdf file
Tableau de Karnaugh en Français, pdf file
Tabular method of minimisation tabular method of minimisation
Traffic lights: a design example pdf file

Home | Site Map | Email: support[at]karadimov.info

Last updated on: 2026-06-24 | Copyright © 2011-2021 Educypedia.

https://educypedia.org

 

 

 

 

 
Powered by ITCom Solutions