Abstract
The Boolean logic minimization is a flexible process which spawned many different techniques to meet various solution requirements, all in order to improve efficiency and lowering costs of constantly evolving technology. There is no single best technique to minimize a Boolean expression. Rather, various techniques are applied depending on the on-set requirements of users. Computer implementation favours algorithmic-based techniques, which will always welcome efficiency improvements. The implemented algorithm, in this paper, is based on the Modified Quine and McCluskey (M Q-M) minimization method. At this time there are several software solutions that allow efficiently minimizing Boolean expressions. None of them however are as compact as the one introduced in this work. This solution will allow the Windows Mobile Smartphone owner to quickly perform minimizations for 2, 3 or 4 variables. The compact nature of the Smartphone, which in essence is a mobile phone, will satisfy the most portability and flexibility of use for this application. At this time there are several software solutions that allow efficiently minimizing Boolean expressions. None of them however are as compact as the one introduced in this work. This solution will allow the Windows Mobile Smartphone owner to quickly perform minimizations for 2, 3 or 4 variables. The compact nature of the Smartphone, which in essence is a mobile phone, will satisfy the most portability and flexibility of use for this application. This solution was developed in C# using Microsoft Visual Studio 2005. Operating platform requirements: Windows Mobile 5.0 operating system with.NET Compact Framework 2.0, or higher.
| Original language | English |
|---|---|
| Pages (from-to) | 1-9 |
| Number of pages | 9 |
| Journal | Journal of Electrical Engineering |
| Volume | 60 |
| Issue number | 5 |
| State | Published - 2 Nov 2009 |
Fingerprint
Keywords
- Boolean simplification
- Quine-McCluskey method
- Smartphone
- Windows Mobile
Cite this
}
BoolCalc! ™ Boolean function simplification calculator for Windows Mobile Smartphone. / Sokolowski, Peter C.; Antoniou, George.
In: Journal of Electrical Engineering, Vol. 60, No. 5, 02.11.2009, p. 1-9.Research output: Contribution to journal › Article › Research › peer-review
TY - JOUR
T1 - BoolCalc! ™ Boolean function simplification calculator for Windows Mobile Smartphone
AU - Sokolowski, Peter C.
AU - Antoniou, George
PY - 2009/11/2
Y1 - 2009/11/2
N2 - The Boolean logic minimization is a flexible process which spawned many different techniques to meet various solution requirements, all in order to improve efficiency and lowering costs of constantly evolving technology. There is no single best technique to minimize a Boolean expression. Rather, various techniques are applied depending on the on-set requirements of users. Computer implementation favours algorithmic-based techniques, which will always welcome efficiency improvements. The implemented algorithm, in this paper, is based on the Modified Quine and McCluskey (M Q-M) minimization method. At this time there are several software solutions that allow efficiently minimizing Boolean expressions. None of them however are as compact as the one introduced in this work. This solution will allow the Windows Mobile Smartphone owner to quickly perform minimizations for 2, 3 or 4 variables. The compact nature of the Smartphone, which in essence is a mobile phone, will satisfy the most portability and flexibility of use for this application. At this time there are several software solutions that allow efficiently minimizing Boolean expressions. None of them however are as compact as the one introduced in this work. This solution will allow the Windows Mobile Smartphone owner to quickly perform minimizations for 2, 3 or 4 variables. The compact nature of the Smartphone, which in essence is a mobile phone, will satisfy the most portability and flexibility of use for this application. This solution was developed in C# using Microsoft Visual Studio 2005. Operating platform requirements: Windows Mobile 5.0 operating system with.NET Compact Framework 2.0, or higher.
AB - The Boolean logic minimization is a flexible process which spawned many different techniques to meet various solution requirements, all in order to improve efficiency and lowering costs of constantly evolving technology. There is no single best technique to minimize a Boolean expression. Rather, various techniques are applied depending on the on-set requirements of users. Computer implementation favours algorithmic-based techniques, which will always welcome efficiency improvements. The implemented algorithm, in this paper, is based on the Modified Quine and McCluskey (M Q-M) minimization method. At this time there are several software solutions that allow efficiently minimizing Boolean expressions. None of them however are as compact as the one introduced in this work. This solution will allow the Windows Mobile Smartphone owner to quickly perform minimizations for 2, 3 or 4 variables. The compact nature of the Smartphone, which in essence is a mobile phone, will satisfy the most portability and flexibility of use for this application. At this time there are several software solutions that allow efficiently minimizing Boolean expressions. None of them however are as compact as the one introduced in this work. This solution will allow the Windows Mobile Smartphone owner to quickly perform minimizations for 2, 3 or 4 variables. The compact nature of the Smartphone, which in essence is a mobile phone, will satisfy the most portability and flexibility of use for this application. This solution was developed in C# using Microsoft Visual Studio 2005. Operating platform requirements: Windows Mobile 5.0 operating system with.NET Compact Framework 2.0, or higher.
KW - Boolean simplification
KW - Quine-McCluskey method
KW - Smartphone
KW - Windows Mobile
UR - http://www.scopus.com/inward/record.url?scp=70350407125&partnerID=8YFLogxK
M3 - Article
VL - 60
SP - 1
EP - 9
JO - Journal of Electrical Engineering
JF - Journal of Electrical Engineering
SN - 1335-3632
IS - 5
ER -