The Quine McCluskey method also called the tabulation method is a very useful and convenient method for simplification of the Boolean functions for a large number of variables (greater than 4). This method is useful over K-map when the number of variables is larger for which K-map formation is difficult. This method simplifies functions by systematically identifying and selecting prime implicants.
In this method, we construct multiple tables based on the input function and finally, we make a prime implicant table which is used to obtain essential prime implicants which are present in the simplified Boolean expression. This method requires prior knowledge of decimal to binary representation and the basics of Boolean algebra. It is a suitable method for a large number of input variables which can be easily solved by this method but the computation complexity is high. Majorly, this method includes the use of minterms, and prime implicants and obtains essential prime implicants which are further used in the simplified Boolean functions.
Terminologies
- Implicant: Implicant is defined as a group of 1s(for minterm).
- Prime implicant: It is the largest possible group of 1s(for minterm).
- Essential Prime implicant: These are groups that cover at least one minterm which cannot be covered by other implicants.
Note: The method requires converting decimal minterms to their binary representation for grouping.
Steps for Quine McCluskey Method
- Arrange the given minterms according to the number of ones present in their binary representation in ascending order.
- Take the minterms from the continuous group if there is only a one-bit change to make their pair.
- Place the '-' symbol where there is a bit change accordingly and keep the remaining bits the same.
- Repeat steps 2 to 3 until we get all prime implicants (when all the bits present in the table are different).
- Make a prime implicant table that consists of the prime implicants (obtained minterms) as rows and the given minterms (given in problem) as columns.
- Place '1' in the cells corresponding to the minterms that are covered by each prime implicant
- Observe the table, if a minterm is covered by only one prime implicant then it is essential to the prime implicant.
- Add the essential prime implicants to the simplified Boolean function.
Solved Examples of Quine McCluskey Method
Example: Simplify using tabulation method : F(A,B,C,D) =∑ m(0,1,2,4,6,8,9,11,13,15)
Solution: Convert the given minterms into their binary representation and arrange them according to the number of ones present in the binary representation.
| TABLE 1 |
|---|
| Group | Minterm | A | B | C | D |
|---|
| 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 1 2 4 8 | 0 0 0 1 | 0 0 1 0 | 0 1 0 0 | 1 0 0 0 |
| 2 | 6 9 | 0 1 | 1 0 | 1 0 | 0 1 |
| 3 | 11 13 | 1 1 | 0 1 | 1 0 | 1 1 |
| 4 | 15 | 1 | 1 | 1 | 1 |
As 0 has no 1 in its representation it is kept in one group(0). Similarly, 1 2 4, and 8 contain one 1 in their representation so it is kept in the next group(1). 6 and 9 in the next group(2), 11, and 13 in the next group(3), 15 in the last group(4).
Now, for table-2 take minterms from successive groups(simultaneous group only) which have an only a 1-bit difference in their representation and form their pair by merging them and making a group of the pairs which are from the same groups that are merged (for example 0 is from group 0 and 1 is from group 1 so it is added to the group 0. 0 belongs to group 0 in table 1 and 2 belongs to group 1 in table 1 so its kept in the same group in table 2. Similarly, make all the possible pairs with the help of the above table and mark - where there is a bit difference.
| TABLE-2 |
|---|
| Group | Pair | A | B | C | D |
|---|
| 0 | (0,1) (0,2) (0,4) (0,8) | 0 0 0 - | 0 0 - 0 | 0 - 0 0 | - 0 0 0 |
| 1 | (1,9) (2,6) (4,6) (8,9) | - 0 0 1 | 0 - 1 0 | 0 1 - 0 | 1 0 0 - |
| 2 | (9,11) (9,13) | 1 1 | 0 - | - 0 | 1 1 |
| 3 | (11,15) (13,15) | 1 1 | - 1 | 1 - | 1 1 |
For table 3 repeat the same step by taking pairs of successive groups merging them where there is only a 1-bit difference and keeping them in groups according to the groups from where they are merged and placed - in bit difference.
| TABLE-3 |
|---|
| Group | Quad | A | B | C | D |
|---|
| 0 | (0,1,8,9) (0,2,4,6) | - 0 | 0 - | 0 - | - 0 |
| 1 | (9,11,13,15) | 1 | - | - | 1 |
After table 3 the process is stopped as there is no 1-bit difference in the remaining group minterms in the simultaneous groups of table 3.
Now, the remaining quads present in table 3 represent the prime implicants for the given Boolean function. So, we construct prime implicants table which contains the obtained prime implicants as rows and the given minterms as columns. Place 1 in the corresponding place which the minterm can represent. Add the minterm to the simplified Boolean expression if the given minterm is only covered by this prime implicant.
| PRIME IMPLICANT TABLE |
|---|
Minterms ⇢ Prime Implicants ⇣ | 0 1 2 4 6 8 9 11 13 15 |
|---|
| B'C' (0,1,8,9) | 1 1 1 1 |
| A'D'(0,2,4,6) | 1 1 1 1 |
| AD(9,11,13,15) | 1 1 1 1 |
| Simplified Boolean function = B'C' + A'D' + AD |
B'C' is in simplified function as minterm 1 is only covered by B'C'. Similarly, minterms 2,4,6 are only covered by A'D' and minterms 11,13,15 are only covered by AD.
Example: Simplify using tabulation method : F(A,B,C,D,E,F,G) = ∑m(20,28,52,60)
Solution: Convert the given minterms in their binary representation and arrange them according to number of one's present in the binary representation.
| TABLE-1 |
|---|
| Group | Minterms | A | B | C | D | E | F | G |
|---|
| 0 | 20 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
| 1 | 28 52 | 0 0 | 0 1 | 1 1 | 1 0 | 1 1 | 0 0 | 0 0 |
| 2 | 60 | 0 | 1 | 1 | 1 | 1 | 0 | 0 |
As 20 has 2 1s in its representation it is kept in one group(0). Similarly, 28 and 52 contain 3 1s in their representation so it is kept in the next group(1). 60 in the next group(2).
Now, for table-2 take minterms from successive groups(simultaneous group only) which have an only a 1-bit difference in their representation and form their pair by merging them and making a group of the pairs which are from the same groups that are merged (for example 20 is from group 0 and 28 is from group 1 so it is added to the group 0. 20 belongs to group 0 in table 1 and 52 belongs to group 1 in table 1 so its kept in the same group in table 2. Similarly, make all the possible pairs with the help of the above table and mark - where it is a bit different.
| TABLE-2 |
|---|
| Group | Pair | A | B | C | D | E | F | G |
|---|
| 0 | (20,28) (20,52) | 0 0 | 0 - | 1 1 | - 0 | 1 1 | 0 0 | 0 0 |
| 1 | (28,60) (52,60) | 0 0 | - 1 | 1 1 | 1 - | 1 1 | 0 0 | 0 0 |
For table 3 repeat the same step by taking pairs of successive groups merging them where there is only a 1-bit difference and keeping them in groups according to the groups from where they are merged and placed - in bit difference.
| TABLE-3 |
|---|
| Group | Quad | A | B | C | D | E | F | G |
|---|
| 0 | (20,28,52,60) | 0 | - | 1 | - | 1 | 0 | 0 |
After table 3 the process is stopped as there is no 1-bit difference in the remaining group minterms in the simultaneous groups of table 3.
Now, the remaining quads present in table 3 represent the prime implicants for the given Boolean function. So, we construct prime implicants table which contains the obtained prime implicants as rows and the given minterms as columns. Place 1 in the corresponding place which the minterm can represent. Add the minterm to the simplified Boolean expression if the given minterm is only covered by this prime implicant.
A'CEF'G' is obtained from table 3 as A, F, G contains 0 so A'F'G', C, and E contain 1 so CE.
| Prime Implicants Table |
|---|
Minterms ⇢ Prime Implicants ⇣ | 20 28 52 60 |
|---|
| A'CEF'G'(20,28,52,60) | 1 1 1 1 |
| Simplified Boolean Function = A'CEF'G' |
A'CEF'G' is in simplified function as it is the only prime implicant that covers all minterms.
Advantages of Quine McCluskey Method
- This method is suitable for a large number of inputs(n>4) for which K-map construction is a tedious task.
- It does not require pattern recognition.
- It provides a systematic and tabular approach.
- It guarantees the minimal Sum of Products (SOP) or Product of Sums (POS) form.
Disadvantages of Quine McCluskey Method
- The computational complexity of this method is high.
- It becomes impractical for functions with more than 6-7 variables due to large tables.
- The method is less intuitive and harder to use manually compared to Karnaugh Maps for smaller functions
Similar Reads
Digital Electronics and Logic Design Tutorials Digital Electronics and Logic Design are key concepts in both electronics and computer science. Digital systems are at the core of everything from basic devices like calculators to advanced computing systems. Digital systems use binary numbers (0s and 1s) to represent and process information.Logic g
4 min read
Number Systems
Boolean Algebra and Logic Gates
Logic Gates - Definition, Types, UsesLogic Gates are the fundamental building blocks in digital electronics. There are basically seven main types of logic gates that are used to perform various logical operations in digital systems. By combining different logic gates, complex operations are performed, and circuits like flip-flops, coun
10 min read
Basic Conversion of Logic GatesIn the Digital System, logic gates are the basic building blocks. Â In these logic gates, we can find the gates having more than one input, but will have only one output. The connection between the input and the output of a gate is based on some logic. Based on this logic, different gates are develop
6 min read
Realization of Logic Gate Using Universal gatesIn Boolean Algebra, the NAND and NOR gates are called universal gates because any digital circuit can be implemented by using any one of these two i.e. any logic gate can be created using NAND or NOR gates only.Implementation of AND Gate using Universal GatesImplementation using NAND GatesThe AND ga
6 min read
Canonical and Standard FormCanonical Form - In Boolean algebra, the Boolean function can be expressed as Canonical Disjunctive Normal Form known as minterm and some are expressed as Canonical Conjunctive Normal Form known as maxterm. In Minterm, we look for the functions where the output results in "1" while in Maxterm we loo
6 min read
Types of Integrated CircuitsIn this article, we will go through the Types of Integrated Circuits, we will start our article with the introductions of the ICs, then we will go through different types of ICs one by one, At last, we will conclude our article will their applications, advantages, disadvantages and some FAQs. Table
7 min read
Minimization Techniques
Minimization of Boolean FunctionsBoolean functions are used to represent logical expressions in terms of sum of minterms or product of maxterms. Number of these literals (minterms or maxterms) increases as the complexity of the digital circuit increases. This can lead to large and inefficient circuits. By minimizing Boolean functio
4 min read
Introduction of K-Map (Karnaugh Map)In many digital circuits and practical problems, we need to find expressions with minimum variables. We can minimize Boolean expressions of 3, 4 variables very easily using K-map without using any Boolean algebra theorems. It is a tool which is used in digital logic to simplify boolean expression. I
5 min read
5 variable K-Map in Digital LogicPrerequisite - Implicant in K-Map Karnaugh Map or K-Map is an alternative way to write a truth table and is used for the simplification of Boolean Expressions. So far we are familiar with 3 variable K-Map & 4 variable K-Map. Now, let us discuss the 5-variable K-Map in detail. Any Boolean Express
5 min read
Various Implicants in K-MapAn implicant can be defined as a product/minterm term in Sum of Products (SOP) or sum/maxterm term in Product of Sums (POS) of a Boolean function. For example, consider a Boolean function, F = AB + ABC + BC. Implicants are AB, ABC, and BC. There are various implicant in K-Map listed below :Prime Imp
5 min read
Don't Care (X) Conditions in K-MapsOne of the most important concepts in simplifying output expressions using Karnaugh Maps (K-Maps) is the 'Don't Care' condition. The 'Don't Care' conditions allow us to treat certain cells in a K-Map as either 0, 1, or to ignore them altogether, which can help in forming larger and more efficient gr
4 min read
Quine McCluskey MethodThe Quine McCluskey method also called the tabulation method is a very useful and convenient method for simplification of the Boolean functions for a large number of variables (greater than 4). This method is useful over K-map when the number of variables is larger for which K-map formation is diffi
8 min read
Two Level Implementation of Logic GatesThe term "two-level logic" refers to a logic design that uses no more than two logic gates between input and output. This does not mean that the entire design will only have two logic gates, but it does mean that the single path from input to output will only have two logic gates.In two-level logic,
9 min read
Combinational Circuits
Half Adder in Digital LogicA half adder is a combinational logic circuit that performs binary addition of two single-bit inputs, A and B, producing two outputs: SUM and CARRY. The SUM output which is the least significant bit (LSB) is obtained using an XOR gate while the CARRY output which is the most significant bit (MSB) is
3 min read
Full Adder in Digital LogicFull Adder is a combinational circuit that adds three inputs and produces two outputs. The first two inputs are A and B and the third input is an input carry as C-IN. The output carry is designated as C-OUT and the normal output is designated as S which is SUM. The C-OUT is also known as the majorit
5 min read
Half Subtractor in Digital LogicA half subtractor is a digital logic circuit that performs the binary subtraction of two single-bit binary numbers. It has two inputs, A and B, and two outputs, Difference and Borrow. The Difference output represents the result of subtracting B from A, while the Borrow output indicates whether a bor
4 min read
Full Subtractor in Digital LogicA Full Subtractor is a combinational circuit used to perform binary subtraction. It has three inputs:A (Minuend)B (Subtrahend)B-IN (Borrow-in from the previous stage)It produces two outputs:Difference (D): The result of the subtraction.Borrow-out (B-OUT): Indicates if a borrow is needed for the next
3 min read
Parallel Adder and Parallel SubtractorAn adder adds two binary numbers one bit at a time using carry from each step. A subtractor subtracts one binary number from another using borrow when needed. A parallel adder adds all bits at once, making addition faster. Similarly, a parallel subtractor subtracts all bits at the same time for quic
5 min read
Sequential Binary MultiplierIn this article, we are going to learn how a sequential binary multiplier works with examples. So for that, we also need to learn a few concepts related to the sequential circuit, binary multipliers, etc. Finally solving the examples using a sequential binary multiplier method.Sequential CircuitA se
12 min read
Multiplexers in Digital LogicIn this article we will go through the multiplexer, we will first define what is a multiplexer then we will go through its types which are 2x1 and 4x1, then we will go through the Implementation of the 2x1 mux and higher mux with lower order mux, at last we will conclude our article with some applic
10 min read
Event Demultiplexer in Node.jsNode.js is designed to handle multiple tasks efficiently using asynchronous, non-blocking I/O operations. But how does it manage multiple operations without slowing down or blocking execution? The answer lies in the Event Demultiplexer.The Event Demultiplexer is a key component of Node.js's event-dr
3 min read
Binary Decoder in Digital LogicA binary decoder is a digital circuit used to convert binary-coded inputs into a unique set of outputs. It does the opposite of what an encoder does. A decoder takes a binary value (such as 0010) and activates exactly one output line corresponding to that value while all other output lines remain in
5 min read
Encoder in Digital LogicAn encoder is a digital circuit that converts a set of binary inputs into a unique binary code. The binary code represents the position of the input and is used to identify the specific input that is active. Encoders are commonly used in digital systems to convert a parallel set of inputs into a ser
7 min read
Code Converters - Binary to/from Gray CodeIn this article, we will go through Code Converters - Binary to/from Gray Code, we will start our article by defining Code converters, Binary code and Gray code, and then we will go through the conversion of binary code to gray code and vice versa.Table Of ContentCode ConvertersBinary CodeGray CodeC
5 min read
Magnitude Comparator in Digital LogicA magnitude digital Comparator is a combinational circuit that compares two digital or binary numbers in order to find out whether one binary number is equal, less than, or greater than the other binary number. We logically design a circuit for which we will have two inputs one for A and the other f
7 min read
Sequential Circuits
Introduction of Sequential CircuitsSequential circuits are digital circuits that store and use the previous state information to determine their next state. Unlike combinational circuits, which only depend on the current input values to produce outputs, sequential circuits depend on both the current inputs and the previous state stor
7 min read
Difference between Combinational and Sequential CircuitIn digital electronics, circuits are classified into two primary categories: The combinational circuits and the sequential circuits. Where the outputs depend on the current inputs are called combination circuit, combinational circuits are simple and effective for functions like addition, subtraction
4 min read
Latches in Digital LogicLatch is a digital circuit which converts its output according to its inputs instantly. To implement latches, we use different logic gates. In this article, we will see the definition of latches, latch types like SR, gated SR, D, gated D, JK and T with its truth table and diagrams and advantages and
7 min read
Flip-Flop types, their Conversion and ApplicationsIn this article, we will go through the Flip-Flop types, their Conversion and their Applications, First, we will go through the definition of the flip-flop with its types in brief, and then we will go through the conversion of the flip-flop with its applications, At last, we will conclude our articl
7 min read
Conversion of Flip-Flop
Register, Counter, and Memory Unit
Counters in Digital LogicA Counter is a device which stores (and sometimes displays) the number of times a particular event or process has occurred, often in relationship to a clock signal. Counters are used in digital electronics for counting purpose, they can count specific event happening in the circuit. For example, in
4 min read
Ripple Counter in Digital LogicCounters play a crucial role in digital logic circuits, enabling tasks such as clock frequency division and sequencing. This article explores the concept of ripple counters, a type of asynchronous counter, their operation, advantages, and disadvantages in digital logic design. What is a Counter?Coun
5 min read
Ring Counter in Digital LogicA ring counter is a typical application of the Shift register. The ring counter is almost the same as the shift counter. The only change is that the output of the last flip-flop is connected to the input of the first flip-flop in the case of the ring counter but in the case of the shift register it
7 min read
General Purpose RegistersA register is a collection of flip-flops. Single bit digital data is stored using flip-flops. By combining many flip-flops, the storage capacity can be extended to accommodate a huge number of bits. We must utilize an n-bit register with n flip flops if we wish to store an n-bit word.General Purpose
8 min read
Shift Registers in Digital LogicPre-Requisite: Flip-FlopsFlip flops can be used to store a single bit of binary data (1 or 0). However, in order to store multiple bits of data, we need multiple flip-flops. N flip flops are to be connected in order to store n bits of data. A Register is a device that is used to store such informati
8 min read
Computer MemoryComputer memory is just like the human brain. It is used to store data/information, and instructions. It is a data storage unit or a data storage device where data is to be processed, and instructions required for processing are stored. Both the input and output can be stored here.It's faster than s
9 min read
Random Access Memory (RAM)Random Access Memory (RAM) is a type of computer memory that stores data temporarily. When you turn off your computer, the data in RAM disappears, unlike the data on your hard drive, which stays saved. RAM helps your computer run programs and process information faster. This is similar to how the br
11 min read
Read Only Memory (ROM)Memory plays a crucial role in how devices operate, and one of the most important types is Read-Only Memory (ROM). Unlike RAM (Random Access Memory), which loses its data when the power is turned off, ROM is designed to store essential information permanently.Here, we’ll explore what ROM is, how it
8 min read
LMNs and GATE PYQs
Practice Questions - Digital Logic & Design