Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Multiple parallel computations of terms of generalized polynomial forms of representations of Boolean functions

Multiple parallel computations of terms of generalized polynomial forms of representations of... Methods for vector and multiple logical computations are described. An algorithm is presented that allows for parallel computations of the values of the conjunctive terms of generalized polynomial forms using multiple sets of variables. Evaluations of the performance of the proposed algorithm are given. An example of multiple parallel computations of the terms of an arithmetic polynomial is analyzed. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Automatic Control and Computer Sciences Springer Journals

Multiple parallel computations of terms of generalized polynomial forms of representations of Boolean functions

Sizonenko, A.
Automatic Control and Computer Sciences , Volume 47 (1) – Mar 7, 2013
Download PDF
7 pages

Loading next page...
 
/lp/springer-journals/multiple-parallel-computations-of-terms-of-generalized-polynomial-2cePDqkPfo

References (5)

Publisher
Springer Journals
Copyright
Copyright © 2013 by Allerton Press, Inc.
Subject
Computer Science; Control Structures and Microprogramming
ISSN
0146-4116
eISSN
1558-108X
DOI
10.3103/S0146411613010069
Publisher site
See Article on Publisher Site

Abstract

Methods for vector and multiple logical computations are described. An algorithm is presented that allows for parallel computations of the values of the conjunctive terms of generalized polynomial forms using multiple sets of variables. Evaluations of the performance of the proposed algorithm are given. An example of multiple parallel computations of the terms of an arithmetic polynomial is analyzed.

Journal

Automatic Control and Computer Sciences – Springer Journals

Published: Mar 7, 2013

There are no references for this article.