Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

S. Lee Hight

dblp:177/1238 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1973
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 64% Hardware reliability and fault tolerance · 36%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
boolean function decomposition
0.011973
Complex Disjunctive Decomposition of Incompletely Specified Boolean Functions · IEEE Trans. Computers 1973
Electronic design automation
logic synthesis
0.011973
Complex Disjunctive Decomposition of Incompletely Specified Boolean Functions · IEEE Trans. Computers 1973
Hardware reliability and fault tolerance
majority voting
0.011973
Dissent in a Majority Voting System · IEEE Trans. Computers 1973
Electronic design automation › logic synthesis › boolean function representation
incompletely specified functions
0.011973
Complex Disjunctive Decomposition of Incompletely Specified Boolean Functions · IEEE Trans. Computers 1973

Methods — techniques the papers use, named apart from their topics

logic function design · 0.0compatibility relation · 0.0ashenhurst-curtis theory · 0.0
YearPublicationVenuePosition
1973 Complex Disjunctive Decomposition of Incompletely Specified Boolean Functions
abstract
In this paper the Ashenhurst-Curtis theory of complex disjunctive decompositions is extended to the realm of incompletely specified Boolean functions. A compatibility relation on the column vectors of the decomposition chart is introduced, which is applied to identify all possible simple disjunctive decompositions for each input partition. The assignments of the DON'T CARE (φ) conditions that are required to realize these simple decompositions are described by a vector listing the constraints on these φ's by new Boolean variables caled constrained DON'T CAREs. A compatibility relation is introduced on these vectors, caled constrained Boolean vectors, which is applied to form complete decompositions. A Complete decomposition is one for which al possible simple decompositions have been combined into a complex decomposition. Throughout the procedure, the freedom of choice implied by the φ's is maintained as far as is alllowed by the choices that have been made to achieve the decompositions.
S. Lee Hight
IEEE Trans. Computers1
1973 Dissent in a Majority Voting System
abstract
The reliability of digital computing systems is a significant problem. A scheme using multiply redundant computing devices with a majority voting device to determine the output has been shown to improve the reliability of that output. In this paper, a devices called a dissent detector is suggested as an addition to the system. The function of this device is that of an alarm to indicate the quality of the information (likelihood that the information is correct). Dissent is defined as a family of logic functions that compare the outputs of the voters to the output of the majority gate and report the disagreement or degree of disagreement that takes place. The operation of a dissent-detector that reports any disagreement in a triplicated majority voting system is demonstrated by example. The example illustrates the importance of the dissent information to the conditional reliability of the output of the majority gate. The results show that, with very little additional equipment, the conditional reliability of a majority voting system can be greatly enhanced. In fact, the conditional reliability of the example system exceeds the reliability of any of the system components, including the majority gate and the dissent detector.
S. Lee Hight, Daniel P. Petersen
IEEE Trans. Computers1