On a Method of Decomposition of Boolean Functions into Unate Functions for Synthesis with Threshold Logic Elements†

DOI10.1080/00207176608921432zbMath0207.31803OpenAlexW2094132595WikidataQ126246068 ScholiaQ126246068MaRDI QIDQ5608043

A. K. Choudhury, Debabrata Sarma, Sunil R. Das

Publication date: 1966

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207176608921432

Mathematics Subject Classification ID

Related Items (3)

Decomposition of Boolean function and two-realizability ⋮ Realization of Boolean functions with a large number of unspecified states by a single threshold logic element † ⋮ Karnaugh map synthesis of multigate threshold networks

Cites Work

• An Essay on Prime Implicant Tables

This page was built for publication: On a Method of Decomposition of Boolean Functions into Unate Functions for Synthesis with Threshold Logic Elements†