DMCA
Fast Boolean Calculations Using Ordered Lists Of Ternary Vectors (1999)
| Venue: | Proceedings of the Third International Conference on Computer-Aided Design of Discrete Devices (CAD DD'99 |
| Citations: | 5 - 5 self |
BibTeX
@INPROCEEDINGS{Steinbach99fastboolean,
author = {Bernd Steinbach and Kristina Dorotska},
title = {Fast Boolean Calculations Using Ordered Lists Of Ternary Vectors},
booktitle = {Proceedings of the Third International Conference on Computer-Aided Design of Discrete Devices (CAD DD'99},
year = {1999},
pages = {20--27}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. Each universal computer can process n Boolean variables in parallel. Compared with sequential calculation of single Boolean variables this property is helpful for acceleration of algorithms. From literature it is known that the compression of lists of Boolean vectors to lists of ternary vectors decreases the number of necessary vectors and consequently the runtime exponentially. The calculation time depends on the number of vectors of the lists. By means of ordering, we try to scale down the calculation complexity much more. Because Boolean spaces are half ordered, we create a model of classes and subclasses which can be ordered. Based on this model we present a fast algorithm for intersection of ordered orthogonal ternary lists, exemplary. The advantages yield from both possible excluding of classes or subclasses and their ordering. Finally, we show by means of experimental results that the two approaches of orthogonal ternary coding on the one hand and ordering of class...
Keyphrases
ternary vector ordered orthogonal ternary list fast algorithm universal computer necessary vector sequential calculation orthogonal ternary coding boolean vector boolean space possible excluding calculation time single boolean variable boolean variable experimental result calculation complexity
