Digital Logic Circuits: Unit II: Combinational Circuits

Limitations of K-maps

Home | Department: EEE Department | Subject: Digital Logic Circuits |
Next >>

• The map method of simplification is convenient as long as the number of variables does not exceed five or six. As the number of variables increases it is difficult to make judgements about which combinations form the minimum expression.

Limitations of K-maps

• The map method of simplification is convenient as long as the number of variables does not exceed five or six. As the number of variables increases it is difficult to make judgements about which combinations form the minimum expression. In case of complex problem with 7, 8 or even 10 variables it is almost an impossible task to simplify expression by the mapping method. Another important point is that the K-map simplification is manual technique and simplification process is heavily depends on the human abilities. To meet this need, W. V. Quine and E. J. McCluskey developed an exact tabular method to simplify the Boolean expression. This method is called the Quine McCluskey or tabular method.

Review Question

1. Explain the limitations of Karnaugh map.

 

Digital Logic Circuits: Unit II: Combinational Circuits : Tag: : - Limitations of K-maps

Home | Department: EEE Department | Subject: Digital Logic Circuits |
Next >>

Digital Logic Circuits: Unit II: Combinational Circuits


Combinational Circuits - Digital Logic Circuits

Boolean Algebra - Terminology, Postulates and Laws, Boolean Theorems, Truth table, Example Problems

Representation of Logic Functions - SOP and POS Forms

Karnaugh Map (K-map) Representation and Minimization using K-maps

Minimization of SOP Expressions - Karnaugh Map (K-map)

Minimization of POS Expressions - Karnaugh Map (K-map)

Five-Variable K-map - with Example Problems

Six-Variable K-map - with Example Problems

Limitations of K-maps

Implementation of Logic Functions using Logic Gates - Symbol, Boolean Expression, Truth Table, Operation function, Example Problems

Introduction to Combinational Logic Circuit - Design Procedure

Adders - Half, Full Adder | Logic diagram, Truth Table, Operation function, Example Problems

Subtractors - Logic diagram, Truth Table, Operation function, Example Problems | Combinational Circuits

Parallel Adder - Block diagram, Working Principle | Combinational Circuits

Parallel Subtractor - Block diagram, Working Principle | Combinational Circuits

Under Subject


Digital Logic Circuits

Digital Logic Circuits

EE3302 3rd Semester EEE Dept | 2021 Regulation | 3rd Semester EEE Dept 2021 Regulation


Related Subjects


Probability and complex function

Probability and complex function

MA3303 3rd Semester EEE Dept | 2021 Regulation | 3rd Semester EEE Dept 2021 Regulation

Electromagnetic Theory

Electromagnetic Theory

EE3301 3rd Semester EEE Dept | 2021 Regulation | 3rd Semester EEE Dept 2021 Regulation

Digital Logic Circuits

Digital Logic Circuits

EE3302 3rd Semester EEE Dept | 2021 Regulation | 3rd Semester EEE Dept 2021 Regulation

Electron Devices and Circuits

Electron Devices and Circuits

EC3301 3rd Semester EEE Dept | 2021 Regulation | 3rd Semester EEE Dept 2021 Regulation

Electrical Machines I

Electrical Machines I

EE3303 EM 1 3rd Semester EEE Dept | 2021 Regulation | 3rd Semester EEE Dept 2021 Regulation

C Programming and Data Structures

C Programming and Data Structures

CS3353 3rd Semester EEE, ECE Dept | 2021 Regulation | 3rd Semester EEE Dept 2021 Regulation