|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Unateness Test of a Boolean Function and Two General Synthesis Methods Using Threshold Logic Elements
February 1969 (vol. 18 no. 2)
pp. 122-131
| ASCII Text | x | ||
| B. Hruz, "Unateness Test of a Boolean Function and Two General Synthesis Methods Using Threshold Logic Elements," IEEE Transactions on Computers, vol. 18, no. 2, pp. 122-131, February, 1969. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1969.222615, author = {B. Hruz}, title = {Unateness Test of a Boolean Function and Two General Synthesis Methods Using Threshold Logic Elements}, journal ={IEEE Transactions on Computers}, volume = {18}, number = {2}, issn = {0018-9340}, year = {1969}, pages = {122-131}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1969.222615}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Unateness Test of a Boolean Function and Two General Synthesis Methods Using Threshold Logic Elements IS - 2 SN - 0018-9340 SP122 EP131 EPD - 122-131 A1 - B. Hruz, PY - 1969 KW - Boolean function KW - code distance and minimal hypercube KW - methods of general synthesis of threshold logic elements KW - minimization of logical networks KW - properties of threshold logic functions KW - threshold logic function KW - transitions of arguments of a Boolean function KW - unateness test. VL - 18 JA - IEEE Transactions on Computers ER - | |||
This paper presents an elaboration of the unateness test of a Boolean function based on the definition of the so-called simple zero or unit transition of arguments of the given Boolean function. It is proved that the unateness of the given Boolean function is subject to the necessary and sufficient condition that there must be no occurrence of both simple unit transition and zero transition at the same time. Whether this condition is satisfied or not can easily be seen from the truth table of the given function.
Index Terms:
Boolean function, code distance and minimal hypercube, methods of general synthesis of threshold logic elements, minimization of logical networks, properties of threshold logic functions, threshold logic function, transitions of arguments of a Boolean function, unateness test.
Citation:
B. Hruz, "Unateness Test of a Boolean Function and Two General Synthesis Methods Using Threshold Logic Elements," IEEE Transactions on Computers, vol. 18, no. 2, pp. 122-131, Feb. 1969, doi:10.1109/T-C.1969.222615
Usage of this product signifies your acceptance of the Terms of Use.