On Combinational Networks with Restricted Fan-Out

Kodandapani,; Seth,

doi:10.1109/tc.1978.1675103

Cited by 10 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Counting of fanout-free functions is somewhat more tractable. Hayes [7] and Kodandapani and Seth [9] have found recurrence relations for the number of functions realized by AON and AOMN fanout-free networks. Bender and Butler [2] have derived closed form approximations to these recurrence relations.…”

Section: Discussionmentioning

confidence: 99%

“…In the algorithms of Hayes [6] and of Kodandapani and Seth [9], all pairs of variables are tested to determine if a relatton, called adjacency, exists. Since adjacency is an equivalence relation, it divides the set of variables into equivalence classes.…”

Section: Synthesis Of Canonical Fanout-free Network Of Positive Symmmentioning

confidence: 99%

“…(9) In the tabular form of functions to be synthesized, it is convenient to list just the assignments A of values to X which cause the function to be 1. Doing this forj~(X) yields Table II.…”

Section: F(x) Is Not Fanout-free Haltmentioning

confidence: 99%

“…For example, Hayes [6] has shown that fanout-free functions realized by networks of AND's, OR's, and inverters can be identified by the use of the adjacency relation. Kodandapani and Seth [9] extended this concept to circuits with AND's, OR's, exclusive OR's, majority gates, and mverters.…”

Section: Introductionmentioning

confidence: 99%

“…As in [9], G will be denoted by a set of letters specifying the gates. For example, AOMN refers to the set of two-input AND's, OR's, three-input majority gates, and inverters.…”

Section: Definitions and Introductory Conceptsmentioning

confidence: 99%

See 4 more Smart Citations

Analysis and Design of Fanout-Free Networks of Positive Symmetric Gates

Butler

1978

J. ACM

View full text Add to dashboard Cite

Art algorithm is presented for assigning functmns to gates in a fanout-free network so that a gwen function is reahzed Since the method is tabular, ~t IS easily programmed As long as the gates used are symmetric and positive the synthesis technique can be tadored to the particular set of gates available, for example, AND, OR, and majority gates It is shown that the functions realized by such networks are a proper subset of the set of unate functions but not of threshold functions Also, ~t is shown that the fanout-free functions that are threshold realizable are exactly those reahzed by the cascade, a special case of the fanout-free network KEY WORDS AND PHRASES swItchmg funcuons, fanout, fanout-free functions, fanout-free networks, unate funcUons, threshold funcUons, posmve symmetnc funcUons, Chow parameters CR CATEGORIES. 6 1

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Synthesis Of Canonical Fanout-free Network Of Positive Symmmentioning

confidence: 99%

Section: F(x) Is Not Fanout-free Haltmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…As in [9], G will be denoted by a set of letters specifying the gates. For example, AOMN refers to the set of two-input AND's, OR's, three-input majority gates, and inverters.…”

Section: Definitions and Introductory Conceptsmentioning

confidence: 99%

See 3 more Smart Citations