Define minterm and the maxterm - canonical form, Computer Engineering

Assignment Help:

Define Minterm and the Maxterm - Canonical Form?

Any Boolean expression perhaps expressed in terms of either minterms or maxterms. The literal is a single variable within a term which may or may not be complemented. For an expression with the N variables, minterms and maxterms are defined as follows:

A minterm is the product of the N distinct literals where each literal occurs exactly once.

A maxterm is the sum of the N distinct literals where each literal occurs exactly once.

For the two-variable expression, the maxterms and minterms are as follows

X	Y	Minterm	Maxterm
0	0	X'.Y'	X+Y
0	1	X'.Y	X+Y'
1	0	X.Y'	X'+Y
1	1	X.Y	X'+Y'

For a three-variable expression, the maxterms and minterms are as follows

X	Y	Z	Minterm	Designation	Maxterm	Designtion
0	0	0	X'.Y'.Z'	m₀	X+Y+Z	M₀
0	0	1	X'.Y'.Z	m₁	X+Y+Z'	M₁
0	1	0	X'.Y.Z'	m₂	X+Y'+Z	M₂
0	1	1	X'.Y.Z	m₃	X+Y'+Z'	M₃
1	0	0	X.Y'.Z'	m₄	X'+Y+Z	M₄
1	0	1	X.Y'.Z	m₅	X'+Y+Z'	M₅
1	1	0	X.Y.Z'	m₆	X'+Y'+Z	M₆
1	1	1	X.Y.Z	m₇	X'+Y'+Z'	M₇

Consider a function F= x'y'z+xy'z'+xyz=m₁₊m₄+m₇

If we take the complement of F then F'= (x+y+z')(x'+y+z)(x'+y'+z')=M₁.M₄.M₇

Any Boolean function can be expressed as a product of Maxterms and Sum of Minterms.

Related Discussions:- Define minterm and the maxterm - canonical form

Define deadlock with resource request and allocation graph, Define Deadlock...

Define Deadlock with Resource request and allocation graph (RRAG) Deadlocks can be described through a directed bipartite graph termed as a RRAG that is Resource Request All

Name the modes of 8255 programmable peripheral interface, What are the diff...

What are the different modes in that 8255 Programmable Peripheral Interface (PPI) can operate? 24 I/O lines in 3-8-bit port groups - A, B, C A, B can be 8-bit input

Determine the octal equivalent of decimal number, The octal equivalent of (...

The octal equivalent of (247) 10 is ? Ans. (247) 10 = (367) 8

Explain pass-1 algorithm of passes used in two-pass-assemble, Explain pass-...

Explain pass-1 algorithm of passes used in two-pass assembler? Pass I: (i) Separate the symbol, operand fields and mnemonic opcode (ii) Make the symbol table (iii)

Advantages of e-commerce, One of the resources we used was Ajeet Khurana's ...

One of the resources we used was Ajeet Khurana's article that talks about the advantages of e-commerce. It was helpful to gain some background on the variety of benefits the electr

Explain a multiprogramming operating system, Explain a multiprogramming ope...

Explain a multiprogramming operating system? A multiprogramming operating system: It is system which allows more than one active user program or part of user program to be st

What are the two types of branch prediction techniques, What are the two ty...

What are the two types of branch prediction techniques available? The two types of branch prediction methods are 1) Static branch prediction 2) Dynamic branch predicti

what is ecc memory, Error-correcting code memory (ECC memory) is a type of...

Error-correcting code memory (ECC memory) is a type of computer data storage that can notice and correct the more general kinds of internal data corruption. ECC memory is used in m

Explain space switching, Explain Space Switching. Space Switches: Con...

Explain Space Switching. Space Switches: Connections can be made in between outgoing and incoming PCM highways by a cross point matrix of the form demonstrated in figure. How

Computer architecture, Explain division and its restoring and non-restoring...

Explain division and its restoring and non-restoring techniques?

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages