Hogar » De Morgan’s Laws

De Morgan’s Laws

1850
  • Augustus De Morgan

De Morgan’s laws are a pair of transformation rules in Boolean algebra that are fundamental to digital circuit design. The first law states that the negation of a conjunction is the disjunction of the negations: [latex]\neg(P \land Q) \iff (\neg P) \lor (\neg Q)[/latex]. The second states that the negation of a disjunction is the conjunction of the negations: [latex]\neg(P \lor Q) \iff (\neg P) \land (\neg Q)[/latex].

In the context of digital electronics, De Morgan’s laws provide a powerful tool for circuit manipulation. They establish a direct equivalence between different types of logic gates. For example, the first law, [latex]\neg(A \cdot B) = \neg A + \neg B[/latex] (using dot for AND and plus for OR), shows that a NAND gate is equivalent to an OR gate with inverted inputs. Similarly, the second law, [latex]\neg(A + B) = \neg A \cdot \neg B[/latex], shows that a NOR gate is equivalent to an AND gate with inverted inputs. This interchangeability is extremely practical. Since NAND and NOR gates are “universal gates”—meaning any Boolean function can be implemented using only NAND gates or only NOR gates—De Morgan’s laws are essential for converting a circuit design from a mix of AND, OR, and NOT gates into a design using a single gate type. This simplifies the fabricación process for integrated circuits, as only one type of logic cell needs to be perfected and replicated. The laws are also used extensively in logic synthesis software to optimize circuits for speed, area, or power consumption by transforming and simplifying the underlying Boolean expressions.

UNESCO Nomenclature: 1202
– Computer science

Tipo

Abstract System

Disruption

Substantial

Utilización

Widespread Use

Precursors

  • Aristotelian logic
  • George Boole’s formulation of symbolic logic
  • Work on duality in algebra and logic by earlier mathematicians

Aplicaciones

  • simplification of boolean expressions in circuit design
  • conversion between and-or logic and nand/nor logic
  • compiler optimization in software
  • database query optimization
  • formal verificación of digital systems

Patentes:

ESO

Potential Innovations Ideas

Membresía obligatoria de Professionals (100% free)

Debes ser miembro de Professionals (100% free) para acceder a este contenido.

Únete ahora

¿Ya eres miembro? Accede aquí
Related to: de morgan’s laws, boolean algebra, logic simplification, nand gate, nor gate, universal gates, digital logic, set theory

Deja una respuesta

Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *

DISPONIBLE PARA NUEVOS RETOS
Ingeniero Mecánico, Gerente de Proyectos o de I+D
Desarrollo eficaz de productos

Disponible para un nuevo desafío a corto plazo.
Contáctame en LinkedIn
Integración de electrónica de plástico y metal, diseño a coste, GMP, ergonomía, dispositivos y consumibles de volumen medio a alto, industrias reguladas, CE y FDA, CAD, Solidworks, cinturón negro Lean Sigma, ISO 13485 médico

Estamos buscando un nuevo patrocinador

 

¿Su empresa o institución se dedica a la técnica, la ciencia o la investigación?
> Envíanos un mensaje <

Recibe todos los artículos nuevos
Gratuito, sin spam, correo electrónico no distribuido ni revendido.

o puedes obtener tu membresía completa -gratis- para acceder a todo el contenido restringido >aquí<

Related Invention, Innovation & Technical Principles

Scroll al inicio

También te puede interesar