article · IEEE Transactions on Computers · 1968
An Algorithm for Multithreshold Threshold Element Synthesis
Cited by 2Abstract and details only
Abstract
Abstract—An algorithm for multithreshold threshold element synthesis, generalizing Haring's "run measure minimization" algorithm, is presented. The algorithm is based on the possibility of assigning equal weights to variables in a symmetry group of a given Boolean function (for totally or partially symmetric Boolean functions). Thus, although a supplementary operation is required for determining the symmetry group of the Boolean functions, both an important reduction in the number of tests required to minimize the number of thresholds and a more economic solution are assured, when synthesizing totally or partially symmetric Boolean functions.
Cite this paper
Necula, N. N. (1968). An Algorithm for Multithreshold Threshold Element Synthesis. IEEE Transactions on Computers, C-17(10), 978–985. https://doi.org/10.1109/tc.1968.226445
Necula, N. N. “An Algorithm for Multithreshold Threshold Element Synthesis.” IEEE Transactions on Computers, vol. C-17, no. 10, 1968, pp. 978–85, https://doi.org/10.1109/tc.1968.226445.
Necula, N. N. 1968. “An Algorithm for Multithreshold Threshold Element Synthesis.” IEEE Transactions on Computers C-17 (10): 978–85. https://doi.org/10.1109/tc.1968.226445.
Necula, N.N. (1968) ‘An Algorithm for Multithreshold Threshold Element Synthesis’, IEEE Transactions on Computers, C-17(10), pp. 978–985. Available at: https://doi.org/10.1109/tc.1968.226445.
@article{necula1968algorithm,
title = {{An Algorithm for Multithreshold Threshold Element Synthesis}},
author = {Necula, N. N.},
journal = {IEEE Transactions on Computers},
volume = {C-17},
number = {10},
pages = {978--985},
year = {1968},
doi = {10.1109/tc.1968.226445}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.