Cited By
View all- Pal A(1986)An Algorithm for Optimal Logic Design Using MultiplexersIEEE Transactions on Computers10.1109/TC.1986.167682635:8(755-757)Online publication date: 1-Aug-1986
Characterization of Unate Cascade Realizability Using Parameters
Pages 218 - 219
Abstract
This correspondence suggests an improved characterization of Boolean functions based on parameters, for unate cascade (UC) realizability. Using this characterization, UC realizability can be readily tested and arrays of UC's can be synthesized to realize arbitrary Boolean functions.
References
[1]
A. Mukhopadhyay, "Unate cellular logic," IEEE Trans. Comput., vol. C-18, pp. 114-121, Feb. 1969.
[2]
S. Muroga, Threshold Logic. New York: Wiley-Interscience, 1972.
[3]
J. Sklansky, "General synthesis of tributory switching functions," IEEE Trans. Electron. Comput., vol. EC-12, pp. 464-469, Oct, 1963.
[4]
B. Elpas and R. A. Short, "A bound on the run measure two of switching functions," IEEE Trans. Electron. Comput., vol. EC-13, pp. 1-4, Feb. 1964.
[5]
S. Bandyopadhyay, S. Ghosh, and A. K. Choudhury, "Synthesis of unate cellular arrays," to be published.
[6]
H. S. Stone and A. J. Koronjak, "Canonical form and synthesis of cellular cascades," IEEE Trans. Electron. Comput., vol. EC-14, pp. 852-862, Dec. 1965.
[7]
R. C. Minnick, "Cellular arrays for logic and storage," Stanford Res. lnst., Stanford Univ., Stanford, Calif., Rep. Project 4641, Apr. 1966.
[8]
D; R. Haring, "Multi-threshold threshold elements," IEEE Trans, Electron. Comput., vol. EC-15, pp. 45-65, Feb. 1966.
[9]
R. C. Minnick, "A survey of microcellular research," J. Ass. Comput. Mach., vol. 14, pp. 203-241, 1967.
[10]
W. S. Matheson, "Recognition of monotonic and unate cascade realizable functions using an informational model of switching circuits," IEEE Trans. Comput. (Short Notes), vol. C-20, PP. 1214-1219, Oct. 1971.
Recommendations
On the Number of Fanout-Free Functions and Unate Cascade Functions
In this correspondence, the number of functions and the number of equivalence classes of functions realized by fanout-free networks and cascades of AND'S, OR'S, and inverters are presented. For fanout-free functions, recursive formulas for TND(n) and f...
Generation of Representative Functions of the NPN Equivalence Classes of Unate Boolean Functions
An algorithm is described which generates the set of representative functions of the negation and/or permutation of variables and negation of the function (NPN) equivalence classes of unate Boolean functions. The algorithm is based upon integer ...
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computingThe Chow parameters of a Boolean function f: {-1,1}n -> {-1,1} are its n+1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that the (exact values of the) Chow parameters of any linear threshold function f uniquely ...
Comments
Information & Contributors
Information
Published In
Copyright © 1975.
Publisher
IEEE Computer Society
United States
Publication History
Published: 01 February 1975
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025
Other Metrics
Citations
Cited By
View all- Pal A(1986)An Algorithm for Optimal Logic Design Using MultiplexersIEEE Transactions on Computers10.1109/TC.1986.167682635:8(755-757)Online publication date: 1-Aug-1986