Contact Us

For Marketing, Sales and Subscriptions Inquiries
Rockefeller Center, 45 Rockefeller Plaza
20th Flr Unit #5, New York, NY 10111
United States

Conference List

Review of Computer Engineering Research

June 2020, Volume 7, 1, pp 27-37

Interactive Algorithms for the Verification of the Equality between Complex and Simplified Boolean-Algebra Expressions in Digital Decoders

Tochukwu Arinze Ikwunne


Samuel Obiora Okide

Tochukwu Arinze Ikwunne 1

Samuel Obiora Okide 2

  1. Alex Ekweme Federal University Ndufu-Aliike Ikwo, Nigeria 1

  2. Nnamdi Azikiwe University Awka, Nigeria 2

Pages: 27-37

DOI: 10.18488/journal.76.2020.71.27.37

Share :

Article History:

Received: 14 January, 2020
Revised: 18 February, 2020
Accepted: 20 March, 2020
Published: 13 April, 2020


This work highlights the use of an algorithm in evaluating and verifying a complex Boolean expression that are used in fabricating digital decoder systems. Digital decoders are built by human beings and, unfortunately, humans make mistakes. Both design errors and faulty implementation may lead both the hardware and software components of systems to behave in unexpected ways, which in turn may lead to business losses and even risky situations. Karnough maps, Boolean algebra theorems and laws are some of the techniques that can be used to simplify and reduce complex Boolean algebra expressions and truth table can be used to confirm that the reduced Boolean algebra expression is the same as the original, complex Boolean algebra expression. However, generating the truth table manually is tedious, especially when the Boolean algebra equation or expression has many Boolean variables. Therefore, this work presents novel algorithms to verify and evaluate complex Boolean expression from the fabricated decoder circuit.
Contribution/ Originality
This study documents the importance of using an algorithmic approach in checking and evaluating the equality of a complex Boolean expression and its simplified form from the fabricated decoder circuit. This is to ensure that the hardware and software systems are designed with reduced or no errors.


Digital decoder, Boolean algebra expression, Seven-segmented display, Combinational logic gate, Verification, Algorithms, Applications.


[1]          D. Tan, "On the structure of finite Boolean algebra," Journal of Mathematical Sciences & Mathematics Education, vol. 5, pp. 20-24, 2011.

[2]          O. E. Oguike, "Algorithms for verifying variants of boolean algebra equations and expressions," African Journal of Computing & ICT, vol. 6, pp. 1-8, 2013.

[3]          M. Dhar, "Fuzzy sets towards forming boolean algebra," International Journal of Energy, Information and Communications, vol. 2, pp. 1-22, 2011.

[4]          L. Rompis, "Boolean agebra for xor gates," Journal of Computer Science and Applications, vol. 1, pp. 14 - 16, 2013.

[5]          E. Clarke and E. Emerson, "Design and synthesis of synchronization skeletons using branching time temporal logic," in Proceedings of Workshop on Logics of Programs, Lecture Notes in Computer Science, Springer-Verlag, 1981, pp. 52–71.

[6]          J. Burch, E. M. Clarke, K. McMillan, D. Dill, and L. Hwang, "Symbolic model checking: 1020 states and beyond," in Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, 1990, pp. 428–39.

[7]          G. Holzmann, Design and validation of computer protocols. Englewood Cliffs: Prentice Hall, Pearson Technology Group USA, 1990.

[8]          E. E. A. and C. Lei, "Efficient model checking in the fragments of the propositional μ-calculus," presented at the Symposion on Logic in Computer Science, IEEE Computer Society Press, 1986.

[9]          D. Long, A. Browne, E. Clarke, S. Jha, and W. Marrero, "An improved algorithm for the evaluation of fixpoint expressions," in Proceedings of International Conference on Computer Aided Verification (CAV’1994), Lecture Notes in Computer Science, Springer-Verlag, 1994, pp. 338–350.

[10]        H. Seidl, "Fast and simple nested fixpoints " Information Processing Letters, vol. 59, pp. 303–308, 1996. Available at:

[11]        X. Liu, C. R. Ramakrishnan, and S. A. Smolka, "Fully local and efficient evaluation of alternating fixed points," in Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, Springer Verlag, 1998, pp. 5–19.

[12]        H. R. Andersen and B. Vergauwen, "Efficient checking of behavioural relations and modal assertions using fixed-point inversion," in Proceedings of Conference on Computer Aided Verification, Lecture Notes on Computer Science, Springer-Verlag, , 1995, pp. 142–154.

[13]        R. Cleaveland and B. Steffen, "Computing behavioural relations logically," in Proceedings of the 18th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Springer-Verlag, 1991, pp. 127–138.

[14]        K. Larsen, "Efficient local correctness checking," in Proceedings of Conference on Computer Aided Verification, Lecture Notes on Computer Science, Springer-Verlag, , 1992, pp. 30–43.

[15]        M. R. . "A generic on-the-fly solver for alternation-free boolean equation systems," in Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’2003), Lecture Notes in Computer Science, Springer Verlag, 2003, pp. 81–96.

[16]        A. Mader, "Verification of modal properties using boolean equation systems," PhD Thesis, Technical University of Munich, 1997.

[17]        J. F. Groote and T. Willemse, "A checker for modal formulas for processes with data," in Proceedings of Formal Methods for Components and Objects, Second International Symposium (FMCO’2003), Lecture Notes in Computer Science, Springer-Verlag, 2004, pp. 223–239.

[18]        J. F. Groote and T. Willemse, "Parameterised boolean equation systems," in Proceedings of the 15th International Conference on Concurrency Theory (CONCUR’2004), Lecture Notes in Computer Science, Springer-Verlag, 2004, pp. 308–324.

[19]        J. F. Groote and T. Willemse, "Parameterised boolean equation systems," Theoretical Computer Science, vol. 343, pp. 332–369, 2005.

[20]        M. Azram, "Arithmetic version of boolean algebra," in Proceeding of 2nd IEEE Internation Conference on Computer Science and Information Technology, 2009, pp. 79 – 80.


Google Scholor ideas Microsoft Academic Search bing Google Scholor


This study received no specific financial support.

Competing Interests:

The authors declare that they have no competing interests.


Both authors contributed equally to the conception and design of the study.

Related Article

( 1 ) Interactive Algorithms for the Verification of the Equality between Complex and Simplified Boolean-Algebra Expressions in Digital Decoders
( 2 ) Comprehensive Analysis & Performance Comparison of Clustering Algorithms for Big Data
( 3 ) A Survey on Sentiment Analysis Algorithms and Datasets
( 5 ) Forecasting Air Passengers of Changi Airport Based on Seasonal Decomposition and an LSSVM Model
( 6 ) Exploring Internet of Thing on PCA Algorithm for Optimization of Facial Detection and Tracking
( 7 ) Feasibility of Chatbot for Mehran UET Examination Department
( 8 ) Information and Communication Technology (Ict) As a Necessity for Libraries and Librarians of Nigerian Universities in the 21st Century
( 9 ) A Study on Commensal Mortality Rate of a Typical Three Species Syn-Eco-System with Unlimited Resources for Commensal
( 10 ) Information and Communication Technology in Classroom Situations in Rural and Urban Areas in Zimbabwe: A Comparative Study on the Use of Digital and Projected Media in Teaching and Learning at Six Secondary Schools in Masvingo
( 11 ) Postbuckling Analysis of Functionally Graded Beams Using Hyperbolic Shear Deformation Theory
( 12 ) Classification and Identification of Risk Management Techniques for Mitigating Risks with Factor Analysis Technique in Software Risk Management
( 13 ) Information about Simulation Software for Testing of Wireless Network
( 14 ) Investigation on the Dependence of TCP Upstream Throughput on Snr for Single and Multiple Links in a Wlan System
( 15 ) RLS Fixed-Lag Smoother Using Covariance Information Based on Innovation Approach in Linear Continuous Stochastic Systems
( 16 ) Real-Time Workload Scheduling (RTWS) Algorithm for Cloud
( 17 ) Performance Analysis of Routing Protocols for CBR Traffic in Mobile Ad-Hoc Networks
( 18 ) Enhanced Isolation Mimo Antenna with DGS Structures for Long Term Evolution Systems
( 19 ) High Isolation Microstrip Mimo Antennas for Wlan Systems
( 20 ) Generalized Quantum Key Distribution for WDM Router Applications
( 21 ) Selection of Appropriate Equipment for Designing Effective Vacuum System
( 22 ) Web Service Composition for E-Commerce Web Application
( 23 ) Role of Library and Information Science Professionals in the Knowledge Society
( 24 ) A Comprehensive Review of Semiconductor-Type Gas Sensors for Environmental Monitoring
( 25 ) Analysis of Suitable Security Protocols for Apply a Model of Identity in the Civil Registry of Ecuador
( 26 ) Path Loss Measurement and Modeling for Lagos State G.S.M Environments
( 27 ) Simulation of the Performance of CdTe/CdS/ZnO Multi- Junction Thin Film Solar Cell
( 28 ) Perturbation Functions for Compact Database
( 29 ) Chaotic Particle Swarm Optimization for Imprecise Combined Economic and Emission Dispatch Problem
( 30 ) Using ICT Policy Framework as a Panacea for Economic Recession and Instability in Nigeria
( 31 ) A Common Operational Picture in Support of Situational Awareness for Efficient Emergency Response Operations
( 32 ) Development Problems of Information Provision on the Management of High Technology Park
( 34 ) A Security Scheme for Protecting Agent Societies
( 35 ) Creation of Algoritms for Recommendation System Based on Users Data on Internet Advertisement Marketing
( 36 ) Development and Performance Analysis of Bisection Method-Based Optimal Path Length Algorithm for Terrestrial Microwave Link
( 37 ) Development of Facilitated Participatory Spatial Information System for Selected Urban Management Services
( 38 ) Stanford University Interim Propagation Loss Model for a Gmelina Arborea Tree-Lined Road
( 39 ) Characterisation of Propagation Loss for a 3G Cellular Network in a Crowded Market Area Using CCIR Model
( 40 ) Development of Web Application for University of Uyo Post UTME Examination Timetable
( 41 ) A Framework for Digital Forensic in Joint Heterogeneous Cloud Computing Environment
( 42 ) A Structural Framework for Distributed Electronic Voters Register
( 43 ) A Review of Machine Learning Models for Software Cost Estimation
( 44 ) Speed Control of Induction Motor on C2000 DSP Platform
( 45 ) Application of Ant Algorithm for Software Optimization
( 47 ) Smart Feature Fusion and Model for Human Detection
( 48 ) LMS Algorithm for Adaptive Transversal Equalization of a Linear Dispersive Communication Channel
( 49 ) Study and Comparative Analysis of Programming Languages Used for Big Data
( 50 ) Activity Recognition and Creation of Web Service for Activity Recognition using Mobile Sensor Data using Azure Machine Learning Studio
( 51 ) Big Data Frameworks for Sites and Products Recommendation
( 52 ) Developing a Software Application for the Study and Learning of Linear a Script