An Algorithm for Automatic Design of Logical Cryogenic Circuits

Sussenguth, Edward H.

doi:10.1109/tec.1961.5219268

Cited by 8 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reader may wish to verify that the function computed by algorithm r from .! (O) = A is as fo�ows: the output Y l is 1 only for configuration numbers (0,2,17-21,23,32, 34-38,40-52,54,56-63) and the output Y 2 is 1 only for configuration numbers (1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13)(14)(15)22,24--31,39,51,53,…”

Section: Functionsmentioning

confidence: 99%

See 1 more Smart Citation

The synthesis of cascade switching circuits

Levien¹

1962

3rd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1962)

View full text Add to dashboard Cite

The problem of synthesizing switching circuits which compute a given, completely specified switching function is considered.A new point-of-view, in which Switching circuits are considered to be realizations of p.lgorithms rather than interpretations of truth-functional formulae, is adopted.A restricted class of algorithms, called the cascade algorithms, is identified and it is suggested that tree and collapsed-tree, iterative, multiple-iterative, sequential, and cascaded-sequential switching circuits may be viewed as realizations of cascade algorithms.Those circuits are called, therefore, cascade circuits.Three basic techniques, functional decomposition, merging, and skipping, which permit the synthesis of efficient cascade algorithms to compute a given function are described.It is then shown how those techniques may be applied so as to synthesize a collapsed-tree, iterative, multiple-iterative, sequential, or cascaded-sequential switching circuit which computes a given switching function.Examples are drawn from the technology of curre nt-steering devices, such as relays and cryotrons, but the method is applicable to other technologies.The procedures appear to be well-adapted to execution on contemporary digital computers.

show abstract

Section: Functionsmentioning

confidence: 99%

“…4) and Su ssenguth (Ref. 5) as well as to a numb er of other relay circuit synthesiS techniques which utilize dis j unctive trees.…”

Section: Heterooeneous Circuitsmentioning

confidence: 99%

The synthesis of cascade switching circuits

Levien¹

1962

3rd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1962)

View full text Add to dashboard Cite

show abstract

“…Several kinds of hardware implementations of Boolean functions can be obtained from a BD-graph: switching circuits [2]; cellular circuits [4]; synthesis with multiplexers or demultiplexers [5,6]; logical cryogenic circuits [7]. The synthesis of a switching circuit, and of a network of demultiplexers, from the BD-graph in Fig.…”

Section: Introductionmentioning

confidence: 99%

Binary-decision graphs for implementation of Boolean functions

Silva¹,

David²

1985

IEE Proc. E Comput. Digit. Tech. UK

View full text Add to dashboard Cite

Binary decision graphs provide the most efficient means for computing Boolean functions by program, and also relate to hardware implementation. In the present paper, formal properties of binary decision graphs are considered, and rules are provided for the anticipation of path lengths and vertex requirements, which indicate computation time and program length, respectively. Rules for the construction of efficient (but not truly optimal) binary decision graphs are provided, these rules are then applied in design examples.

show abstract

The synthesis of cryotronic circuits

Kochur¹,

Mikhaı̆lov²

1972

Cybern Syst Anal

View full text Add to dashboard Cite

An Algorithm for Automatic Design of Logical Cryogenic Circuits

Cited by 8 publications

References 5 publications

The synthesis of cascade switching circuits

The synthesis of cascade switching circuits

Binary-decision graphs for implementation of Boolean functions

The synthesis of cryotronic circuits

Contact Info

Product

Resources

About