Evolution of the Boolean function manipulation

Solving large systems of Boolean equations is a hard combinatorial problem. It can be greatly facilitated by preliminarily reducing the number of roots in separate equations which, in turn, leads to a reduction in the number of variables, equations and time complexity. This can have a significant ef...

Full description

Bibliographic Details
Main Authors: Sim, Poh Ching, Chin, Kui Fern, Suaidi, M.K
Format: Article
Language:English
Published: IEEE 2002
Subjects:
Online Access:http://ir.unimas.my/id/eprint/16557/
http://ir.unimas.my/id/eprint/16557/1/Evolution%20of%20the%20Boolean%20Function%20Manipulation%20%28abstract%29.pdf
_version_ 1848838086787596288
author Sim, Poh Ching
Chin, Kui Fern
Suaidi, M.K
author_facet Sim, Poh Ching
Chin, Kui Fern
Suaidi, M.K
author_sort Sim, Poh Ching
building UNIMAS Institutional Repository
collection Online Access
description Solving large systems of Boolean equations is a hard combinatorial problem. It can be greatly facilitated by preliminarily reducing the number of roots in separate equations which, in turn, leads to a reduction in the number of variables, equations and time complexity. This can have a significant effect upon the physical space and connectivity of electronic logic circuits when these are implemented using actual electronic devices or components. In this paper, we review various representation techniques, Boolean function manipulation issues and problems that are used in a practical design environment for digital systems design.
first_indexed 2025-11-15T06:49:58Z
format Article
id unimas-16557
institution Universiti Malaysia Sarawak
institution_category Local University
language English
last_indexed 2025-11-15T06:49:58Z
publishDate 2002
publisher IEEE
recordtype eprints
repository_type Digital Repository
spelling unimas-165572017-06-08T06:46:16Z http://ir.unimas.my/id/eprint/16557/ Evolution of the Boolean function manipulation Sim, Poh Ching Chin, Kui Fern Suaidi, M.K T Technology (General) Solving large systems of Boolean equations is a hard combinatorial problem. It can be greatly facilitated by preliminarily reducing the number of roots in separate equations which, in turn, leads to a reduction in the number of variables, equations and time complexity. This can have a significant effect upon the physical space and connectivity of electronic logic circuits when these are implemented using actual electronic devices or components. In this paper, we review various representation techniques, Boolean function manipulation issues and problems that are used in a practical design environment for digital systems design. IEEE 2002 Article PeerReviewed text en http://ir.unimas.my/id/eprint/16557/1/Evolution%20of%20the%20Boolean%20Function%20Manipulation%20%28abstract%29.pdf Sim, Poh Ching and Chin, Kui Fern and Suaidi, M.K (2002) Evolution of the Boolean function manipulation. Student Conference on Research and Development, 2002. SCOReD 2002. ISSN ISBN: 0-7803-7565-3 http://ieeexplore.ieee.org/document/1033059/ DOI: 10.1109/SCORED.2002.1033059
spellingShingle T Technology (General)
Sim, Poh Ching
Chin, Kui Fern
Suaidi, M.K
Evolution of the Boolean function manipulation
title Evolution of the Boolean function manipulation
title_full Evolution of the Boolean function manipulation
title_fullStr Evolution of the Boolean function manipulation
title_full_unstemmed Evolution of the Boolean function manipulation
title_short Evolution of the Boolean function manipulation
title_sort evolution of the boolean function manipulation
topic T Technology (General)
url http://ir.unimas.my/id/eprint/16557/
http://ir.unimas.my/id/eprint/16557/
http://ir.unimas.my/id/eprint/16557/
http://ir.unimas.my/id/eprint/16557/1/Evolution%20of%20the%20Boolean%20Function%20Manipulation%20%28abstract%29.pdf