1995
DOI: 10.1049/ip-cdt:19952016
|View full text |Cite
|
Sign up to set email alerts
|

Synthesis of multioutput logic networks using spectral techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

1998
1998
2016
2016

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(11 citation statements)
references
References 0 publications
0
11
0
Order By: Relevance
“…7 The last illustration serves as an overall illustration of algorithm BASIC-MOTO-X and demonstrates the opportunities of simplification that may arise and which are taken care of in a post-processing step. Assume that we have two outputs (given here in sum-of-minterms form, with the notation (4,5,9,12,13). Assume that minterms m 0 , m 8 of OUT1 and minterms m 4 , m 5 , m 12 , m 13 of OUT2 have already been examined.…”
Section: A Illustrationsmentioning
confidence: 99%
See 4 more Smart Citations
“…7 The last illustration serves as an overall illustration of algorithm BASIC-MOTO-X and demonstrates the opportunities of simplification that may arise and which are taken care of in a post-processing step. Assume that we have two outputs (given here in sum-of-minterms form, with the notation (4,5,9,12,13). Assume that minterms m 0 , m 8 of OUT1 and minterms m 4 , m 5 , m 12 , m 13 of OUT2 have already been examined.…”
Section: A Illustrationsmentioning
confidence: 99%
“…(The notation d() indicates don't care minterms.) Function BAR1 ( Table 1 in [3]) with outputs: (3,4,5,6,7).…”
Section: Other Functionsmentioning
confidence: 99%
See 3 more Smart Citations