World Library  
Flag as Inappropriate
Email this Article

Combinational logic

Article Id: WHEBN0000089371
Reproduction Date:

Title: Combinational logic  
Author: World Heritage Encyclopedia
Language: English
Subject: Digital electronics, Dynamic logic (digital electronics), Programmable logic device, Espresso heuristic logic minimizer, Sequential logic
Collection: Digital Electronics, Logic in Computer Science
Publisher: World Heritage Encyclopedia

Combinational logic

In digital circuit theory, combinational logic (sometimes also referred to as time-independent logic[1] ) is a type of digital logic which is implemented by Boolean circuits, where the output is a pure function of the present input only. This is in contrast to sequential logic, in which the output depends not only on the present input but also on the history of the input. In other words, sequential logic has memory while combinational logic does not.

Combinational logic is used in computer circuits to perform Boolean algebra on input signals and on stored data. Practical computer circuits normally contain a mixture of combinational and sequential logic. For example, the part of an arithmetic logic unit, or ALU, that does mathematical calculations is constructed using combinational logic. Other circuits used in computers, such as half adders, full adders, half subtractors, full subtractors, multiplexers, demultiplexers, encoders and decoders are also made by using combinational logic.

An alternate term is combinatorial logic,[2] though this usage may be considered controversial.[3]


  • Representation 1
  • Logic formula minimization 2
  • See also 3
  • References 4
  • External links 5


Combinational logic is used to build circuits that produce specified outputs from certain inputs. The construction of combinational logic is generally done using one of two methods: a sum of products, or a product of sums. A sum of products can be visualized in a truth table, as in this example:

A B C Result Logical equivalent
F F F F \neg A \cdot \neg B \cdot \neg C
F F T F \neg A \cdot \neg B \cdot C
F T F F \neg A \cdot B \cdot \neg C
F T T F \neg A \cdot B \cdot C
T F F T A \cdot \neg B \cdot \neg C
T F T F A \cdot \neg B \cdot C
T T F F A \cdot B \cdot \neg C
T T T T A \cdot B \cdot C

Using sum of products, all logical statements which yield true results are summed, giving the result:

A \cdot \neg B \cdot \neg C + A \cdot B \cdot C \,

Using Boolean algebra, the result simplifies to the following equivalent of the truth table:

A \cdot (\neg B \cdot \neg C + B \cdot C) \,

Logic formula minimization

Minimization (simplification) of combinational logic formulas is done using the following rules:

(A + B) \cdot (A + C) = A + (B \cdot C)
\quad (A \cdot B) + (A \cdot C) = A \cdot (B + C)
A + (A \cdot B) = A
\quad A \cdot (A + B) = A
A + (\lnot A \cdot B) = A + B
\quad A \cdot(\lnot A + B) = A \cdot B
(A + B)\cdot(\lnot A + B)=B
\quad (A \cdot B) + (\lnot A \cdot B)=B
(A \cdot B) + (\lnot A \cdot C) + (B \cdot C) = (A \cdot B) + (\lnot A \cdot C)
(A + B) \cdot (\lnot A + C) \cdot (B + C) = (A + B) \cdot (\lnot A + C)

With the use of minimization (sometimes called logic optimization), a simplified logical function or circuit may be arrived upon, and the logic combinational circuit becomes smaller, and easier to analyse, use, or build.

See also


  1. ^ C.J. Savant, Jr.; Martin Roden; Gordon Carpenter. "Electronic Design: Circuits and Systems". 1991. ISBN 0-8053-0285-9 p. 682
  2. ^ Clive Maxfield. "FPGAs: World Class Designs". p. 70. 2009. ISBN 1856176215
  3. ^ Cliff Cummings. "Common Mistakes In Technical Texts". 2009.
  • Michael Predko and Myke Predko, Digital electronics demystified, McGraw-Hill, 2004. ISBN 0-07-144141-7

External links

  • Combinational Logic & Systems Tutorial Guide by D. Belton, R. Bigwood.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.