SlideShare a Scribd company logo
International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013

ADAPTIVE MAP FOR SIMPLIFYING BOOLEAN
EXPRESSIONS
Dr. Mohammed H. AL-Jammas
Department of Computer and Information Engineering,
College of Electronics Engineering, University of Mosul, Mosul - Iraq

ABSTRACT
The complexity of implementing the Boolean functions by digital logic gates is directly related to the
complexity of the Boolean algebraic expression. Although the truth table is used to represent a function,
when it is expressed algebraically it appeared in many different, but equivalent, forms. Boolean expressions
may be simplified by Boolean algebra. However, this procedure of minimization is awkward because it
lacks specific rules to predict each succeeding step in the manipulative process. Other methods like Map
methods (Karnaugh map (K-map), and map Entered Variables) are useful to implement the Boolean
expression with minimal prime implicants. Or the Boolean function can be represents and design by used
type N’s Multiplexers by partitioned variable(s) from the function. An adaptive map is a combined method
of Boolean algebra and K-map to reduce and minimize Boolean functions involving more than three
Boolean variables.

KEYWORDS
Adaptive map, Boolean function, Entered variable, K-map, Partitioned variable

1. INTRODUCTION
Because binary logic is used in all digital computers and digital devices, the cost of the circuits is
an important factor addressed by designers [1]. Finding simpler and cheaper, but equivalent,
realizations of a circuit can reap huge payoffs in reducing the overall cost of the design.
Mathematical method, map methods, tabular methods, and, other methods are used to simplify
and implements Boolean functions.

2. MATHEMATICAL METHOD
In mathematical method, the Boolean algebra, like any other mathematical system, is defined
with set of elements, set of operators, and number of unproved axioms or postulates. All Boolean
expressions, regardless of their form, can be writes in two standard forms: the (SOP) Sum-OfProducts form or the (POS) Product-Of-Sums form. Standardization makes evaluates, simplified,
and implements the Boolean expressions more systematic and easier [2].
Boolean algebra is formal to express a digital logic equations, and represents a logical design in
an alpha-numeric way. The Boolean algebra format, and many of logic manipulates rules and
techniques were formalized around 1850 by George Boole, an Irish mathematician. It was used a
systematic approach to solving problems in logic and reasoning. With the advent of modern
electronics, and digital systems in particular, Boolean algebra found a natural home. In addition to
being used as a tool for deductive reasoning, it is now an almost indispensable tool to design the
digital logic circuits and machines.
DOI : 10.5121/ijcses.2013.4601

1
International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013

3. MAP METHOD
However, the map method presented here provides a simple, straightforward procedure for
minimize Boolean functions. This method regarded as a pictorial form of a truth table. The map
method is also known as Karnaugh map or K-map.
The Karnaugh map, like Boolean algebra, is a simplification tool applicable to digital logic. The
Karnaugh map is simplified logic expression faster and more easily in most cases. Boolean
simplification is faster than the Karnaugh map for a task involving two or fewer Boolean
variables. It is still quite usable at three variables, but a bit slower. At four input variables,
Boolean algebra becomes tedious. Karnaugh maps are both, faster and easier, work well for up to
six input variables. For more than six to eight variables, simplification should be by CAD
(Computer Automated Design) [3], or use other methods.

4. TABULAR METHOD
In tabular methods for function minimization have been devised that can be implemented by a
computer and can therefore be used to minimize functions having a large number of input
variables. One such method has become known as the Quine-McClusky (Q-M) algorithm.
Typical of these methods, the Q-M algorithms first finds the prime implicants and then generates
the minimum cover [4].

5. ENTERED VARIABLE K-MAP METHOD
The K-maps are only useful up to and including functions with six variables, but in the case of a
function having a larger number of variables and providing the function does not contain too
many terms it can be useful to plot it on a reduced dimension map. Such a map is one in which
the individual cells can now contain variables, so that a map for m variables can be used to
represent functions having (m+1) or even (m+2) variables [5]. The entered variable mapping,
which is a logical and very useful extension of conventional (1’s and 0’s) mapping methods
developed previously. Entered variable K-maps are the most common form of graphical
representation, two types of variables shown in K-map, the map variable which represent the
index of K-map, and the entered variables (1’s, 0’s, don’t care, and variable).

6. SHANNON’S EXPANSION THEOREM
Designing with Multiplexers resolves around applying a theorem called Shannon’s Expansion
Theorem. The theorem can be stated as follows:
૛࢔ ି૚

۴ = ෍ ۷࢏ . ࢓࢏
࢏ୀ૙

……………………………………………

(૚)

Where mi is a minterm consisting of n select signals that are applied to the select inputs and Ii is
the input data (used for applying 2n input data signals) [6], the input signals (1’s, 0’s, don’t care,
and variable).
Boolean functions with a large number of inputs can be accommodate by constructing
Multiplexer trees (cascade Multiplexers) to implement functions, but it is not easily reduced or
2
International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013

implement functions with a larger than normal number of inputs. It is not necessary to write every
binary entry for every signal in the truth table, since we can reduce the output column by simply
listing the binary values of the partitioned-off signal (or signals). The type of Multiplexers design
simply agrees with the number of input signals partitioned off in the truth table of the function.
For example, we called type 2 Multiplexer when implement the function when partitioned off two
signals.

7. ADAPTIVE MAP
To implement the Boolean function with large number of input signal, it is suitable to use entered
variable method, or use type n Multiplexer. The complexity of these methods is how to find the
input data of Multiplexer, or find the entered variables in K-map.
In this paper, make a combination between Boolean algebra, K-map, Entered variables, and
Shanno’s theorem methods that suggest how to find the variables to implements function by
different types of multiplexers, or by Map Entered variable method.
An adaptive map is build with a variable location of sub-cubes in K-map. The sub-cubes locations
are adaptive with the partitioned off variables or with entered variables.

7.1. The Partitioning off One Variable
Assume a function with four variables,
૛࢔ ି૚

ࢌ(࡭, ࡮, ࡯, ࡰ) = ෍ ࡵ࢏ . ࢓࢏
࢏ୀ૙

… … … … . . (૛)

n=4 number of variables.
The variable D is a less significant bit (20 = 1), while variable C is (21 = 2), and variable A is (23 =
8). These values used to implements function with new location of sub-cubes when any of these
variables is partitioned off.
The flowing Adaptive map represents the case when partitioned off one variable.
Partitioned off variable D (20=1)
The difference of location between each two
sub-cubes in the same column = 20 = 1
ABC
D 000 001 010 011 100 101 110 111
I0
I2
I4
I6
I8
I10
I12
I14
0 m
m2 m4 m6 m8 m10 m12 m14
0
I1
I3
I5
I7
I9
I11
I13
I15
1 m
m3 m5 m7 m9 m11 m13 m15
1

3
International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013

Partitioned off variable B (22=4)
The difference of location between each two
sub-cubes in the same column = 22 = 4
B 000
I
0 0
m0
I
1 4
m4

001
I1
m2
I5
m5

010
I2
m4
I6
m6

ACD
011 100
I3
I8
m6 m8
I7
I12
m7 m12

101
I9
m9
I13
m13

110
I10
m10
I14
m14

111
I11
m11
I15
m15

In the adaptive map shown in (a), the equivalent prime implicants of each column (from column 0
to column 7) can be found using direct Boolean algebra.
P0 = I0.m0 + I1.m1, P1 = I2.m2 + I3.m3, , , P7 = I14.m14 + I15.m15.
The Po, P1, , , P7 are inputs data to the (8X1) Multiplexer with (A,B,C) are the select signals, or
an entered variable in map entered variable method that shown below:
The same way in map show in (b), the equivalent prime implicants can find by:
P0 = I0.m0 + I4.m4 , P1 = I1.m1 + I5.m5, , , P7 = I11.m11 + I15.m15
The P0 , P1 , , P7 are the inputs data to the (8X1) Multiplexer with (A,C,D) are select Signals
BC
A
0
1

00
P0
P4

01
P1
P5

CD
11
P3
P7

10
P2
P6

A
0
1

00
P0
P4

01
P1
P5

11
P3
P7

10
P2
P6

7.2. Partitioned off Two Variables
Here we assume a function with five variables,
૛૞ ି૚

ࢌ(࡭, ࡮, ࡯, ࡰ, ࡱ) = ෍ ࡵ࢏ . ࢓࢏
࢏ୀ૙

… … … … . . (૜)

The variable E is less significant bit (20 = 1), while variable B is (23 = 8), and variable A is (24 =
16). These values used to implement the function with new location of sub-cubes when two of
these variables are partitioned off.
The flowing Adaptive map is represent the case of partitioning two variables

4
International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013

Partitioned off variables E (20=1), and D (21=2)
The difference between sub-cubes in same column is 20 and 21
ABC
DE

000

001

010

011

100

101

110

111

00

I0
m0

I4
m4

I8
m8

I12
m12

I16
m16

I20
m20

I24
m24

I28
m28

01

I1
m1

I5
m5

I9
m9

I13
m13

I17
m17

I21
m21

I25
m25

I29
m29

10

I2
m2

I6
m6

I10
m10

I14
m14

I18
m18

I22
m22

I26
m26

I30
m30

11

I3
m3

I7
m7

I11
m11

I15
m15

I19
m19

I23
m23

I27
m27

I31
m31

Partitioned off variables B (23=8), and C (22=4)
The difference between sub-cubes in same column is 22 and 23
ADE

00

000
I0
m0

001
I1
m2

010
I2
m4

011
I3
m6

100
I16
m16

101
I17
m17

110
I18
m18

111
I19
m19

01

I4
m4

I5
m5

I6
m6

I7
m7

I20
m20

I21
m21

I22
m22

I23
m23

10

I8
m8

I9
m9

I10
m10

I11
m11

I24
m24

I25
m25

I26
m26

I27
m27

11

I12
m12

I13
m13

I14
m14

I15
m15

I28
m28

I29
m29

I30
m30

I31
m31

BC

In the adaptive map shown in (a), the equivalent prime implicants of each column (from column 0
to column 7) can be found using direct Boolean algebra.
P0 = I0.m0 + I1.m1 + I2.m2 + I3.m3, , , P7 = I28.m28 + I29.m29 + I30.m30 + I31.m31
The P0 , P1 , , P7 are the inputs data to the (8X1) Multiplexer with (A,B,C) are select signals, or
use an entered variable in the map shown below
The same way in map (b), the equivalent prime implicants can find by:
P0 = I0.m0 + I4.m4 + I8.m8 + I12.m12, , , P7 = I19.m19 + I23.m23 + I27.m27 + I31.m31
The P0 , P1 , , P7 are the inputs data to the (8X1) Multiplexer with (A,D,E) are select signals
BC
A
0
1

00
P0
P4

01
P1
P5

DE
11
P3
P7

10
P2
P6

A
0
1

00
P0
P4

01
P1
P5

11
P3
P7

10
P2
P6

5
International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013

7.3. Partitioned off Three Variables
A function with five variables can be represent as,
૛૞ ି૚

ࢌ(࡭, ࡮, ࡯, ࡰ, ࡱ) = ෍ ࡵ࢏ . ࢓࢏

… … … … . . (૝)

࢏ୀ૙

The flowing Adaptive map represents the case of partitioning off three variables.
Partitioned off variables B (23=8),
C (22=4), and D (21=2)
The difference of location between subcubes in the same column = 21 , 22 , and 23

Partitioned off variables A (24=16),
C (22=4), and E (20=1)
The difference of location between subcubes in the same column = 20 ,22 ,and 24

AE
BCD
000
001
010
011
100
101
110
111

00
I0
m0
I2
m2
I4
m4
I6
m6
I8
m8
I10
m10
I12
m12
I14
m14

01
I1
m1
I3
m3
I5
m5
I7
m7
I9
m9
I11
m11
I13
m13
I15
m15

BD
11
I16
m16
I18
m18
I20
m20
I22
m22
I24
m24
I26
m26
I28
m28
I30
m30

10
I17
m17
I19
m19
I21
m21
I23
m23
I25
m25
I27
M27
I29
m29
I31
m31

ACE
000
001
010
011
100
101
110
111

00
I0
m0
I1
m1
I4
m4
I5
m5
I16
m16
I17
m17
I20
m20
I21
m21

01
I2
m2
I3
m3
I6
m6
I7
m7
I18
m18
I19
m19
I22
m22
I23
m23

11
I8
m8
I9
m9
I12
m12
I13
m13
I24
m24
I25
m25
I28
m28
I29
m29

10
I10
m10
I11
m11
I14
m14
I15
m15
I26
m26
I27
m27
I30
m30
I31
m31

In the adaptive map show in (a), the equivalent prime implicants of each column (from column 0
to column 4) can be fined use direct Boolean algebra.
P0 = I0.m0 + I2.m2 + I4.m4 + I6.m6 + I8.m8 + I10.m10 + I12.m12 + I14.m14
The P0 , P1 , P3 , P4 are the inputs to the (4X1) Multiplexer with (A,E) are select signals, or use an
entered variable in the map.
The same way in map (b), the equivalent prime implicants can find by:
P0 = I0.m0 + I1.m1 + I4.m4 + I5.m5 + I16.m16 + I17.m17 + I20.m20 + I21.m21
The P0 , P1 , P3 , P4 are the inputs data to the (4X1) Multiplexer with (B,D) are select signals

8. CONCLUSIONS
The most simplification methods are useful for less than 6 variables. A large number of input
signals will be complex to simplify the function and implements with minimal logic gates, or use
a suitable multiplexer. The adaptive map is a useful method used to reduce the K-map size and
6
International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013

simplify the function use entered variable method, or to use type n multiplexers with number of
select signals less than the number of the input signals.
This method gives more imagination to designer to find different way to simplify any complex
Boolean function with more than three input signals.

REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]

M. Morris Mano, and Michael D. Ciletti,(2006) Digital Design, Fourth Edition, Prentice Hall.
Thomas L. Floyd, (2006) Digital Fundamentals, Ninth Edition, Prentice Hall.
Tony R. Kuphaldt, (2007) Lessons In Electric Circuits, Volume IV – Digital.
Richard F. Tinder, (2000) Engineering Digital Design, Second Edition, Academic Press (AP).
Brain Holdsworth, and Clive Woods, (2002) Digital Logic Design, Fourth Edition, Copyright
Material.
Richard S. Sandige, (1990) Modern Digital Design. Mcgraw-Hill
Richard S. Sandige, and Michael L. Sandige, (2012) Fundamentals of Digital and Computer Design
with VHDL, McGraw Hill.

Author
Mohammed H. AL-Jammas (Jun’02) born in 1966 in Mosul-Iraq. He awarded BSc in
Electronic and Communication Engineering from the University of Mosul, Mosul-Iraq
in 1988. Next, he awarded the MSc in Communication from the University of Mosul,
Mosul-Iraq in 1994, and PhD in Computer Engineering from the University of
Technology, Baghdad-Iraq in 2007. From 2002-2006, Dr. Mohammed worked with
the University of Technology in Baghdad. From 2007, he acts as an Assistance dean of
the College of Electronics Engineering at the University of Mosul.
Through his academic life he published over 5 papers in field of computer
engineering, and information security.

7

More Related Content

PDF
Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...
PPT
Geographic Information System unit 4
PDF
10.1.1.630.8055
PPTX
Image recogonization
PPTX
PDF
AN OPTIMAL FUZZY LOGIC SYSTEM FOR A NONLINEAR DYNAMIC SYSTEM USING A FUZZY BA...
PDF
04 programming 2
PDF
LOGNORMAL ORDINARY KRIGING METAMODEL IN SIMULATION OPTIMIZATION
Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...
Geographic Information System unit 4
10.1.1.630.8055
Image recogonization
AN OPTIMAL FUZZY LOGIC SYSTEM FOR A NONLINEAR DYNAMIC SYSTEM USING A FUZZY BA...
04 programming 2
LOGNORMAL ORDINARY KRIGING METAMODEL IN SIMULATION OPTIMIZATION

What's hot (19)

PDF
An efficient hardware logarithm generator with modified quasi-symmetrical app...
PDF
CLIM Program: Remote Sensing Workshop, Statistical Emulation with Dimension R...
PPTX
Application of interpolation in CSE
PDF
Interpolation and-its-application
PDF
Information Hiding for “Color to Gray and back” with Hartley, Slant and Kekre...
PPT
S6 l04 analytical and numerical methods of structural analysis
PPTX
Fourier Transform Assignment Help
PPTX
Unit 3.1
PDF
CLIM: Transition Workshop - Statistical Emulation with Dimension Reduction fo...
PDF
R01741124127
PDF
A Novel Low Complexity Histogram Algorithm for High Performance Image Process...
PDF
A lossless color image compression using an improved reversible color transfo...
PDF
LRIEEE-MTT
PPTX
Computation Assignment Help
PPTX
Extrapolation
PPTX
Unit 2.4
PDF
IRJET- An Image Cryptography using Henon Map and Arnold Cat Map
PDF
GASGD: Stochastic Gradient Descent for Distributed Asynchronous Matrix Comple...
An efficient hardware logarithm generator with modified quasi-symmetrical app...
CLIM Program: Remote Sensing Workshop, Statistical Emulation with Dimension R...
Application of interpolation in CSE
Interpolation and-its-application
Information Hiding for “Color to Gray and back” with Hartley, Slant and Kekre...
S6 l04 analytical and numerical methods of structural analysis
Fourier Transform Assignment Help
Unit 3.1
CLIM: Transition Workshop - Statistical Emulation with Dimension Reduction fo...
R01741124127
A Novel Low Complexity Histogram Algorithm for High Performance Image Process...
A lossless color image compression using an improved reversible color transfo...
LRIEEE-MTT
Computation Assignment Help
Extrapolation
Unit 2.4
IRJET- An Image Cryptography using Henon Map and Arnold Cat Map
GASGD: Stochastic Gradient Descent for Distributed Asynchronous Matrix Comple...
Ad

Viewers also liked (9)

PPS
Primer concurs de taules 2
PDF
A survey on cost effective survivable network design in wireless access network
PDF
Token Based Packet Loss Control Mechanism for Networks
PDF
Vision based entomology a survey
DOCX
the client assignment problem for continuous distributed interactive applicat...
PDF
RESEARCH ON DISTRIBUTED SOFTWARE TESTING PLATFORM BASED ON CLOUD RESOURCE
PPTX
Population
PDF
A comparative survey based on processing network traffic data using hadoop pi...
Primer concurs de taules 2
A survey on cost effective survivable network design in wireless access network
Token Based Packet Loss Control Mechanism for Networks
Vision based entomology a survey
the client assignment problem for continuous distributed interactive applicat...
RESEARCH ON DISTRIBUTED SOFTWARE TESTING PLATFORM BASED ON CLOUD RESOURCE
Population
A comparative survey based on processing network traffic data using hadoop pi...
Ad

Similar to ADAPTIVE MAP FOR SIMPLIFYING BOOLEAN EXPRESSIONS (20)

PDF
Adaptive Map for Simplifying Boolean Expressions
PPTX
PDF
Drobics, m. 2001: datamining using synergiesbetween self-organising maps and...
PPTX
DCF - K map
PDF
Chapter-3.pdf
PDF
Chapter-3.pdf
PDF
EXTENDED K-MAP FOR MINIMIZING MULTIPLE OUTPUT LOGIC CIRCUITS
PPTX
Chapter Data Representation DIGITAL LOGIC CIRCUITS
PDF
Implementation of Low-Complexity Redundant Multiplier Architecture for Finite...
PPTX
DIGITAL ELECTRONICS KMAP Boolean algebra
PDF
Engineering Numerical Analysis-Introduction.pdf
PDF
Combinational logic
PDF
FYBSC IT Digital Electronics Unit II Chapter II Minterm, Maxterm and Karnaugh...
PDF
MODIFIED LLL ALGORITHM WITH SHIFTED START COLUMN FOR COMPLEXITY REDUCTION
PDF
Design of optimized Interval Arithmetic Multiplier
PDF
6_nome_e_numero_Chapra_Canale_1998_Numerical_Differentiation_and_Integration.pdf
PDF
Fault diagnosis using genetic algorithms and
PPTX
Karnaugh map or K-map method
PDF
Digital Electronics Most Essential and Frequently Asked Interview Questions
PDF
A Robust Method Based On LOVO Functions For Solving Least Squares Problems
Adaptive Map for Simplifying Boolean Expressions
Drobics, m. 2001: datamining using synergiesbetween self-organising maps and...
DCF - K map
Chapter-3.pdf
Chapter-3.pdf
EXTENDED K-MAP FOR MINIMIZING MULTIPLE OUTPUT LOGIC CIRCUITS
Chapter Data Representation DIGITAL LOGIC CIRCUITS
Implementation of Low-Complexity Redundant Multiplier Architecture for Finite...
DIGITAL ELECTRONICS KMAP Boolean algebra
Engineering Numerical Analysis-Introduction.pdf
Combinational logic
FYBSC IT Digital Electronics Unit II Chapter II Minterm, Maxterm and Karnaugh...
MODIFIED LLL ALGORITHM WITH SHIFTED START COLUMN FOR COMPLEXITY REDUCTION
Design of optimized Interval Arithmetic Multiplier
6_nome_e_numero_Chapra_Canale_1998_Numerical_Differentiation_and_Integration.pdf
Fault diagnosis using genetic algorithms and
Karnaugh map or K-map method
Digital Electronics Most Essential and Frequently Asked Interview Questions
A Robust Method Based On LOVO Functions For Solving Least Squares Problems

More from ijcses (10)

PDF
A Study of Various Steganographic Techniques Used for Information Hiding
PDF
Neural network based numerical digits recognization using nnt in matlab
PDF
Congestion control in packet switched wide area networks using a feedback model
PDF
Ijcses(most cited articles)
PDF
MULTIDIMENSIONAL ANALYSIS FOR QOS IN WIRELESS SENSOR NETWORKS
PDF
A survey of real-time routing protocols For wireless sensor networks
PDF
An Approach to Detect Packets Using Packet Sniffing
PDF
Artificial intelligence markup language: a Brief tutorial
PDF
A NOBEL HYBRID APPROACH FOR EDGE DETECTION
PDF
PHYSICAL MODELING AND SIMULATION OF THERMAL HEATING IN VERTICAL INTEGRATED ...
A Study of Various Steganographic Techniques Used for Information Hiding
Neural network based numerical digits recognization using nnt in matlab
Congestion control in packet switched wide area networks using a feedback model
Ijcses(most cited articles)
MULTIDIMENSIONAL ANALYSIS FOR QOS IN WIRELESS SENSOR NETWORKS
A survey of real-time routing protocols For wireless sensor networks
An Approach to Detect Packets Using Packet Sniffing
Artificial intelligence markup language: a Brief tutorial
A NOBEL HYBRID APPROACH FOR EDGE DETECTION
PHYSICAL MODELING AND SIMULATION OF THERMAL HEATING IN VERTICAL INTEGRATED ...

Recently uploaded (20)

PDF
Empathic Computing: Creating Shared Understanding
PDF
KodekX | Application Modernization Development
PPTX
MYSQL Presentation for SQL database connectivity
PDF
Mobile App Security Testing_ A Comprehensive Guide.pdf
PPT
“AI and Expert System Decision Support & Business Intelligence Systems”
PDF
Electronic commerce courselecture one. Pdf
PDF
Per capita expenditure prediction using model stacking based on satellite ima...
PDF
Unlocking AI with Model Context Protocol (MCP)
PDF
TokAI - TikTok AI Agent : The First AI Application That Analyzes 10,000+ Vira...
PDF
[발표본] 너의 과제는 클라우드에 있어_KTDS_김동현_20250524.pdf
PPTX
20250228 LYD VKU AI Blended-Learning.pptx
PDF
7 ChatGPT Prompts to Help You Define Your Ideal Customer Profile.pdf
PDF
Peak of Data & AI Encore- AI for Metadata and Smarter Workflows
PPTX
PA Analog/Digital System: The Backbone of Modern Surveillance and Communication
PDF
Modernizing your data center with Dell and AMD
PPTX
Effective Security Operations Center (SOC) A Modern, Strategic, and Threat-In...
PDF
Chapter 3 Spatial Domain Image Processing.pdf
PDF
Shreyas Phanse Resume: Experienced Backend Engineer | Java • Spring Boot • Ka...
PDF
Advanced methodologies resolving dimensionality complications for autism neur...
PDF
Machine learning based COVID-19 study performance prediction
Empathic Computing: Creating Shared Understanding
KodekX | Application Modernization Development
MYSQL Presentation for SQL database connectivity
Mobile App Security Testing_ A Comprehensive Guide.pdf
“AI and Expert System Decision Support & Business Intelligence Systems”
Electronic commerce courselecture one. Pdf
Per capita expenditure prediction using model stacking based on satellite ima...
Unlocking AI with Model Context Protocol (MCP)
TokAI - TikTok AI Agent : The First AI Application That Analyzes 10,000+ Vira...
[발표본] 너의 과제는 클라우드에 있어_KTDS_김동현_20250524.pdf
20250228 LYD VKU AI Blended-Learning.pptx
7 ChatGPT Prompts to Help You Define Your Ideal Customer Profile.pdf
Peak of Data & AI Encore- AI for Metadata and Smarter Workflows
PA Analog/Digital System: The Backbone of Modern Surveillance and Communication
Modernizing your data center with Dell and AMD
Effective Security Operations Center (SOC) A Modern, Strategic, and Threat-In...
Chapter 3 Spatial Domain Image Processing.pdf
Shreyas Phanse Resume: Experienced Backend Engineer | Java • Spring Boot • Ka...
Advanced methodologies resolving dimensionality complications for autism neur...
Machine learning based COVID-19 study performance prediction

ADAPTIVE MAP FOR SIMPLIFYING BOOLEAN EXPRESSIONS

  • 1. International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013 ADAPTIVE MAP FOR SIMPLIFYING BOOLEAN EXPRESSIONS Dr. Mohammed H. AL-Jammas Department of Computer and Information Engineering, College of Electronics Engineering, University of Mosul, Mosul - Iraq ABSTRACT The complexity of implementing the Boolean functions by digital logic gates is directly related to the complexity of the Boolean algebraic expression. Although the truth table is used to represent a function, when it is expressed algebraically it appeared in many different, but equivalent, forms. Boolean expressions may be simplified by Boolean algebra. However, this procedure of minimization is awkward because it lacks specific rules to predict each succeeding step in the manipulative process. Other methods like Map methods (Karnaugh map (K-map), and map Entered Variables) are useful to implement the Boolean expression with minimal prime implicants. Or the Boolean function can be represents and design by used type N’s Multiplexers by partitioned variable(s) from the function. An adaptive map is a combined method of Boolean algebra and K-map to reduce and minimize Boolean functions involving more than three Boolean variables. KEYWORDS Adaptive map, Boolean function, Entered variable, K-map, Partitioned variable 1. INTRODUCTION Because binary logic is used in all digital computers and digital devices, the cost of the circuits is an important factor addressed by designers [1]. Finding simpler and cheaper, but equivalent, realizations of a circuit can reap huge payoffs in reducing the overall cost of the design. Mathematical method, map methods, tabular methods, and, other methods are used to simplify and implements Boolean functions. 2. MATHEMATICAL METHOD In mathematical method, the Boolean algebra, like any other mathematical system, is defined with set of elements, set of operators, and number of unproved axioms or postulates. All Boolean expressions, regardless of their form, can be writes in two standard forms: the (SOP) Sum-OfProducts form or the (POS) Product-Of-Sums form. Standardization makes evaluates, simplified, and implements the Boolean expressions more systematic and easier [2]. Boolean algebra is formal to express a digital logic equations, and represents a logical design in an alpha-numeric way. The Boolean algebra format, and many of logic manipulates rules and techniques were formalized around 1850 by George Boole, an Irish mathematician. It was used a systematic approach to solving problems in logic and reasoning. With the advent of modern electronics, and digital systems in particular, Boolean algebra found a natural home. In addition to being used as a tool for deductive reasoning, it is now an almost indispensable tool to design the digital logic circuits and machines. DOI : 10.5121/ijcses.2013.4601 1
  • 2. International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013 3. MAP METHOD However, the map method presented here provides a simple, straightforward procedure for minimize Boolean functions. This method regarded as a pictorial form of a truth table. The map method is also known as Karnaugh map or K-map. The Karnaugh map, like Boolean algebra, is a simplification tool applicable to digital logic. The Karnaugh map is simplified logic expression faster and more easily in most cases. Boolean simplification is faster than the Karnaugh map for a task involving two or fewer Boolean variables. It is still quite usable at three variables, but a bit slower. At four input variables, Boolean algebra becomes tedious. Karnaugh maps are both, faster and easier, work well for up to six input variables. For more than six to eight variables, simplification should be by CAD (Computer Automated Design) [3], or use other methods. 4. TABULAR METHOD In tabular methods for function minimization have been devised that can be implemented by a computer and can therefore be used to minimize functions having a large number of input variables. One such method has become known as the Quine-McClusky (Q-M) algorithm. Typical of these methods, the Q-M algorithms first finds the prime implicants and then generates the minimum cover [4]. 5. ENTERED VARIABLE K-MAP METHOD The K-maps are only useful up to and including functions with six variables, but in the case of a function having a larger number of variables and providing the function does not contain too many terms it can be useful to plot it on a reduced dimension map. Such a map is one in which the individual cells can now contain variables, so that a map for m variables can be used to represent functions having (m+1) or even (m+2) variables [5]. The entered variable mapping, which is a logical and very useful extension of conventional (1’s and 0’s) mapping methods developed previously. Entered variable K-maps are the most common form of graphical representation, two types of variables shown in K-map, the map variable which represent the index of K-map, and the entered variables (1’s, 0’s, don’t care, and variable). 6. SHANNON’S EXPANSION THEOREM Designing with Multiplexers resolves around applying a theorem called Shannon’s Expansion Theorem. The theorem can be stated as follows: ૛࢔ ି૚ ۴ = ෍ ۷࢏ . ࢓࢏ ࢏ୀ૙ …………………………………………… (૚) Where mi is a minterm consisting of n select signals that are applied to the select inputs and Ii is the input data (used for applying 2n input data signals) [6], the input signals (1’s, 0’s, don’t care, and variable). Boolean functions with a large number of inputs can be accommodate by constructing Multiplexer trees (cascade Multiplexers) to implement functions, but it is not easily reduced or 2
  • 3. International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013 implement functions with a larger than normal number of inputs. It is not necessary to write every binary entry for every signal in the truth table, since we can reduce the output column by simply listing the binary values of the partitioned-off signal (or signals). The type of Multiplexers design simply agrees with the number of input signals partitioned off in the truth table of the function. For example, we called type 2 Multiplexer when implement the function when partitioned off two signals. 7. ADAPTIVE MAP To implement the Boolean function with large number of input signal, it is suitable to use entered variable method, or use type n Multiplexer. The complexity of these methods is how to find the input data of Multiplexer, or find the entered variables in K-map. In this paper, make a combination between Boolean algebra, K-map, Entered variables, and Shanno’s theorem methods that suggest how to find the variables to implements function by different types of multiplexers, or by Map Entered variable method. An adaptive map is build with a variable location of sub-cubes in K-map. The sub-cubes locations are adaptive with the partitioned off variables or with entered variables. 7.1. The Partitioning off One Variable Assume a function with four variables, ૛࢔ ି૚ ࢌ(࡭, ࡮, ࡯, ࡰ) = ෍ ࡵ࢏ . ࢓࢏ ࢏ୀ૙ … … … … . . (૛) n=4 number of variables. The variable D is a less significant bit (20 = 1), while variable C is (21 = 2), and variable A is (23 = 8). These values used to implements function with new location of sub-cubes when any of these variables is partitioned off. The flowing Adaptive map represents the case when partitioned off one variable. Partitioned off variable D (20=1) The difference of location between each two sub-cubes in the same column = 20 = 1 ABC D 000 001 010 011 100 101 110 111 I0 I2 I4 I6 I8 I10 I12 I14 0 m m2 m4 m6 m8 m10 m12 m14 0 I1 I3 I5 I7 I9 I11 I13 I15 1 m m3 m5 m7 m9 m11 m13 m15 1 3
  • 4. International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013 Partitioned off variable B (22=4) The difference of location between each two sub-cubes in the same column = 22 = 4 B 000 I 0 0 m0 I 1 4 m4 001 I1 m2 I5 m5 010 I2 m4 I6 m6 ACD 011 100 I3 I8 m6 m8 I7 I12 m7 m12 101 I9 m9 I13 m13 110 I10 m10 I14 m14 111 I11 m11 I15 m15 In the adaptive map shown in (a), the equivalent prime implicants of each column (from column 0 to column 7) can be found using direct Boolean algebra. P0 = I0.m0 + I1.m1, P1 = I2.m2 + I3.m3, , , P7 = I14.m14 + I15.m15. The Po, P1, , , P7 are inputs data to the (8X1) Multiplexer with (A,B,C) are the select signals, or an entered variable in map entered variable method that shown below: The same way in map show in (b), the equivalent prime implicants can find by: P0 = I0.m0 + I4.m4 , P1 = I1.m1 + I5.m5, , , P7 = I11.m11 + I15.m15 The P0 , P1 , , P7 are the inputs data to the (8X1) Multiplexer with (A,C,D) are select Signals BC A 0 1 00 P0 P4 01 P1 P5 CD 11 P3 P7 10 P2 P6 A 0 1 00 P0 P4 01 P1 P5 11 P3 P7 10 P2 P6 7.2. Partitioned off Two Variables Here we assume a function with five variables, ૛૞ ି૚ ࢌ(࡭, ࡮, ࡯, ࡰ, ࡱ) = ෍ ࡵ࢏ . ࢓࢏ ࢏ୀ૙ … … … … . . (૜) The variable E is less significant bit (20 = 1), while variable B is (23 = 8), and variable A is (24 = 16). These values used to implement the function with new location of sub-cubes when two of these variables are partitioned off. The flowing Adaptive map is represent the case of partitioning two variables 4
  • 5. International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013 Partitioned off variables E (20=1), and D (21=2) The difference between sub-cubes in same column is 20 and 21 ABC DE 000 001 010 011 100 101 110 111 00 I0 m0 I4 m4 I8 m8 I12 m12 I16 m16 I20 m20 I24 m24 I28 m28 01 I1 m1 I5 m5 I9 m9 I13 m13 I17 m17 I21 m21 I25 m25 I29 m29 10 I2 m2 I6 m6 I10 m10 I14 m14 I18 m18 I22 m22 I26 m26 I30 m30 11 I3 m3 I7 m7 I11 m11 I15 m15 I19 m19 I23 m23 I27 m27 I31 m31 Partitioned off variables B (23=8), and C (22=4) The difference between sub-cubes in same column is 22 and 23 ADE 00 000 I0 m0 001 I1 m2 010 I2 m4 011 I3 m6 100 I16 m16 101 I17 m17 110 I18 m18 111 I19 m19 01 I4 m4 I5 m5 I6 m6 I7 m7 I20 m20 I21 m21 I22 m22 I23 m23 10 I8 m8 I9 m9 I10 m10 I11 m11 I24 m24 I25 m25 I26 m26 I27 m27 11 I12 m12 I13 m13 I14 m14 I15 m15 I28 m28 I29 m29 I30 m30 I31 m31 BC In the adaptive map shown in (a), the equivalent prime implicants of each column (from column 0 to column 7) can be found using direct Boolean algebra. P0 = I0.m0 + I1.m1 + I2.m2 + I3.m3, , , P7 = I28.m28 + I29.m29 + I30.m30 + I31.m31 The P0 , P1 , , P7 are the inputs data to the (8X1) Multiplexer with (A,B,C) are select signals, or use an entered variable in the map shown below The same way in map (b), the equivalent prime implicants can find by: P0 = I0.m0 + I4.m4 + I8.m8 + I12.m12, , , P7 = I19.m19 + I23.m23 + I27.m27 + I31.m31 The P0 , P1 , , P7 are the inputs data to the (8X1) Multiplexer with (A,D,E) are select signals BC A 0 1 00 P0 P4 01 P1 P5 DE 11 P3 P7 10 P2 P6 A 0 1 00 P0 P4 01 P1 P5 11 P3 P7 10 P2 P6 5
  • 6. International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013 7.3. Partitioned off Three Variables A function with five variables can be represent as, ૛૞ ି૚ ࢌ(࡭, ࡮, ࡯, ࡰ, ࡱ) = ෍ ࡵ࢏ . ࢓࢏ … … … … . . (૝) ࢏ୀ૙ The flowing Adaptive map represents the case of partitioning off three variables. Partitioned off variables B (23=8), C (22=4), and D (21=2) The difference of location between subcubes in the same column = 21 , 22 , and 23 Partitioned off variables A (24=16), C (22=4), and E (20=1) The difference of location between subcubes in the same column = 20 ,22 ,and 24 AE BCD 000 001 010 011 100 101 110 111 00 I0 m0 I2 m2 I4 m4 I6 m6 I8 m8 I10 m10 I12 m12 I14 m14 01 I1 m1 I3 m3 I5 m5 I7 m7 I9 m9 I11 m11 I13 m13 I15 m15 BD 11 I16 m16 I18 m18 I20 m20 I22 m22 I24 m24 I26 m26 I28 m28 I30 m30 10 I17 m17 I19 m19 I21 m21 I23 m23 I25 m25 I27 M27 I29 m29 I31 m31 ACE 000 001 010 011 100 101 110 111 00 I0 m0 I1 m1 I4 m4 I5 m5 I16 m16 I17 m17 I20 m20 I21 m21 01 I2 m2 I3 m3 I6 m6 I7 m7 I18 m18 I19 m19 I22 m22 I23 m23 11 I8 m8 I9 m9 I12 m12 I13 m13 I24 m24 I25 m25 I28 m28 I29 m29 10 I10 m10 I11 m11 I14 m14 I15 m15 I26 m26 I27 m27 I30 m30 I31 m31 In the adaptive map show in (a), the equivalent prime implicants of each column (from column 0 to column 4) can be fined use direct Boolean algebra. P0 = I0.m0 + I2.m2 + I4.m4 + I6.m6 + I8.m8 + I10.m10 + I12.m12 + I14.m14 The P0 , P1 , P3 , P4 are the inputs to the (4X1) Multiplexer with (A,E) are select signals, or use an entered variable in the map. The same way in map (b), the equivalent prime implicants can find by: P0 = I0.m0 + I1.m1 + I4.m4 + I5.m5 + I16.m16 + I17.m17 + I20.m20 + I21.m21 The P0 , P1 , P3 , P4 are the inputs data to the (4X1) Multiplexer with (B,D) are select signals 8. CONCLUSIONS The most simplification methods are useful for less than 6 variables. A large number of input signals will be complex to simplify the function and implements with minimal logic gates, or use a suitable multiplexer. The adaptive map is a useful method used to reduce the K-map size and 6
  • 7. International Journal of Computer Science & Engineering Survey (IJCSES) Vol.4, No.6, December 2013 simplify the function use entered variable method, or to use type n multiplexers with number of select signals less than the number of the input signals. This method gives more imagination to designer to find different way to simplify any complex Boolean function with more than three input signals. REFERENCES [1] [2] [3] [4] [5] [6] [7] M. Morris Mano, and Michael D. Ciletti,(2006) Digital Design, Fourth Edition, Prentice Hall. Thomas L. Floyd, (2006) Digital Fundamentals, Ninth Edition, Prentice Hall. Tony R. Kuphaldt, (2007) Lessons In Electric Circuits, Volume IV – Digital. Richard F. Tinder, (2000) Engineering Digital Design, Second Edition, Academic Press (AP). Brain Holdsworth, and Clive Woods, (2002) Digital Logic Design, Fourth Edition, Copyright Material. Richard S. Sandige, (1990) Modern Digital Design. Mcgraw-Hill Richard S. Sandige, and Michael L. Sandige, (2012) Fundamentals of Digital and Computer Design with VHDL, McGraw Hill. Author Mohammed H. AL-Jammas (Jun’02) born in 1966 in Mosul-Iraq. He awarded BSc in Electronic and Communication Engineering from the University of Mosul, Mosul-Iraq in 1988. Next, he awarded the MSc in Communication from the University of Mosul, Mosul-Iraq in 1994, and PhD in Computer Engineering from the University of Technology, Baghdad-Iraq in 2007. From 2002-2006, Dr. Mohammed worked with the University of Technology in Baghdad. From 2007, he acts as an Assistance dean of the College of Electronics Engineering at the University of Mosul. Through his academic life he published over 5 papers in field of computer engineering, and information security. 7