On the synthesis of oriented switching circuits
From MaRDI portal
Publication:2563384
Optimal implementation with oriented contact circuits of a logic function is discussed. The asymptotic behaviour of the Shannon function \(\overrightarrow{L}(n)\) is studied. It is well-known that the difference between the upper and the lower bound of \(\overrightarrow{L}(n)\) is of order \({\mathcal O}(2^{n}\log_{2}n/n^{2})\). A new method of contact circuits synthesis is proposed. With its help the upper bound can be improved, and it is shown that the above mentioned difference is of order \({\mathcal O}(2^{n}/n^{2})\).
Recommendations
- On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts
- On the synthesis of some types of circuits based on translation partitions generated by universal matrices
- On complexity of oriented contact circuits with limited out-degree
- Bounds on Shannon functions of lengths of contact closure tests for contact circuits
Cited in
(8)- On the synthesis of some types of circuits based on translation partitions generated by universal matrices
- Crossed rings -- small-diameter multiring switches and their 1-1-rearrangeability
- On complexity of oriented contact circuits with limited out-degree
- scientific article; zbMATH DE number 5529980 (Why is no real title available?)
- scientific article; zbMATH DE number 1194179 (Why is no real title available?)
- On the search of optimal order of variables in the synthesis of switching circuits by cascade technique
- Literal Selection in Switching Lattice Design
- On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts
This page was built for publication: On the synthesis of oriented switching circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563384)
