Casa » 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 produzione 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

Utilizzo

Widespread Use

Precursors

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

Applicazioni

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

Brevetti:

QUELLO

Potential Innovations Ideas

Livelli! Iscrizione richiesta

Per accedere a questo contenuto devi essere un membro di !Professionals (100% free)!

Iscriviti ora

Siete già membri? Accedi
Related to: de morgan’s laws, boolean algebra, logic simplification, nand gate, nor gate, universal gates, digital logic, set theory

Lascia un commento

Il tuo indirizzo email non sarà pubblicato. I campi obbligatori sono contrassegnati *

DISPONIBILE PER NUOVE SFIDE
Ingegnere meccanico, responsabile di progetto o di ricerca e sviluppo
Sviluppo efficace del prodotto

Disponibile per una nuova sfida con breve preavviso.
Contattami su LinkedIn
Integrazione di componenti elettronici in plastica e metallo, progettazione in base ai costi, GMP, ergonomia, dispositivi e materiali di consumo di medio-alto volume, settori regolamentati, CE e FDA, CAD, Solidworks, Lean Sigma Black Belt, ISO 13485 in ambito medico

Stiamo cercando un nuovo sponsor

 

La tua azienda o istituzione si occupa di tecnica, scienza o ricerca?
> inviaci un messaggio <

Ricevi tutti i nuovi articoli
Gratuito, no spam, email non distribuita né rivenduta

oppure puoi ottenere la tua iscrizione completa -gratuitamente- per accedere a tutti i contenuti riservati >Qui<

Related Invention, Innovation & Technical Principles

Torna in alto

Potrebbe anche piacerti