Minterms and maxterms of boolean's expression

  • Thread starter Thread starter desmond iking
  • Start date Start date
  • Tags Tags
    Expression
Click For Summary
SUMMARY

The discussion clarifies the definitions of minterms and maxterms in Boolean expressions. Minterms represent the sum of products, where each term is an AND operation of variables x, y, and z, evaluated to true when any specific combination of these variables is true. Conversely, maxterms are defined as the product of sums, where each term is an OR operation of the variables. This duality allows for different representations of Boolean functions, essential for digital logic design.

PREREQUISITES
  • Understanding of Boolean algebra
  • Familiarity with digital logic design concepts
  • Knowledge of truth tables
  • Basic skills in using logic gates (AND, OR, NOT)
NEXT STEPS
  • Study the principles of Karnaugh maps for simplifying Boolean expressions
  • Learn about the Quine-McCluskey algorithm for minimizing Boolean functions
  • Explore the implementation of Boolean functions using logic circuits
  • Investigate the applications of minterms and maxterms in programmable logic devices
USEFUL FOR

This discussion is beneficial for students of computer science, electrical engineering, and anyone involved in digital circuit design or Boolean algebra analysis.

desmond iking
Messages
284
Reaction score
2
i couldn't find the definition of Minterms and maxterms of boolean's expression on the internet nor my book. Can someone explain it? I was given only this in my book, without any explanation.
 

Attachments

  • IMG_20141215_184208[1].jpg
    IMG_20141215_184208[1].jpg
    80.8 KB · Views: 1,293
  • IMG_20141215_184258[1].jpg
    IMG_20141215_184258[1].jpg
    64.4 KB · Views: 753
Engineering news on Phys.org
The two definitions are right there in the photo you posted 2.3.1

Try reading it again and look at the examples provided.

The first f(x,y,z) adds up a bunch of Boolean terms. Each term is composed of factors of x,y and z. X,y and z can have values of 0 or 1 so each term is an AND of x,y and z. The adding is in reality the OR operation.

The equation is saying f(x,y,z) is true when xyz is true OR x'yz is true OR ... That's a minterm way of defining the f function.

The alternate way to define the f function is to use a product of factors with each factor being an OR of x, y, z inputs.
 

Similar threads

Engineering Where Did the Minterm AB'C Come From in This Boolean Function?
  • · Replies 5 ·
Replies
5
Views
2K
Understanding Canonical Maxterm Form and 'Big M' Notation for Karnaugh Maps
  • · Replies 3 ·
Replies
3
Views
4K
Understanding Karnaugh Maps: Two Ways of Representation
  • · Replies 5 ·
Replies
5
Views
2K
When Should I Use Minterms and Maxterms in Digital Electronics?
  • · Replies 1 ·
Replies
1
Views
2K
Weird logic-design exam questions
  • · Replies 2 ·
Replies
2
Views
11K
Truth table to boolean expression
  • · Replies 3 ·
Replies
3
Views
3K
Calculators Help with newly installed program on TI-89
  • · Replies 1 ·
Replies
1
Views
4K
Converting a boolean expression into simplest product of sums
  • · Replies 2 ·
Replies
2
Views
6K
Post-Karnaugh map simplification
  • · Replies 1 ·
Replies
1
Views
2K
Implementing boolean functions with decoder and external gate
  • · Replies 6 ·
Replies
6
Views
18K