Abstract
This paper describes a method for defining, analyzing, testing, and implementing large digital functions by means of a binary decision diagram. This diagram provides a complete, concise, "implementation-free" description of the digital functions involved. Methods are described for deriving these diagrams and examples are given for a number of basic combinational and sequential devices. Techniques are then outlined for using the diagrams to analyze the functions involved, for test generation, and for obtaining various implementations. It is shown that the diagrams are especially suited for processing by a computer. Finally, methods are described for introducing inversion and for directly "interconnecting" diagrams to define still larger functions. An example of the carry look-ahead adder is included.
Keywords
Binary decision diagramComputer scienceBinary numberInfluence diagramAdderTheoretical computer scienceAlgorithmImplementationDigital electronicsDiagramArithmeticProgramming languageMathematicsData miningDecision treeLatency (audio)
Affiliated Institutions
Related Publications
Local Properties of Binary Images in Two Dimensions
Aspects of topology and geometry are used in analyzing continuous and discrete binary images in two dimensions. Several numerical properties of these images are derived which ar...
Improvement of Binary Transmission by Null-Zone Reception
In the customary methods of transmitting binary data the receiver, as a result of the decision process made on each transmitted pulse, prints out one of two symbols. Schemes are...
dendextend: an R package for visualizing, adjusting and comparing trees of hierarchical clustering
Abstract Summary: dendextend is an R package for creating and comparing visually appealing tree diagrams. dendextend provides utility functions for manipulating dendrogram objec...
Automated generation of heuristics for biological sequence comparison
Abstract Background Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to i...
Low-density parity-check codes
A low-density parity-check code is a code specified by a parity-check matrix with the following properties: each column contains a small fixed number <tex xmlns:mml="http://www....
Publication Info
- Year
- 1978
- Type
- article
- Volume
- C-27
- Issue
- 6
- Pages
- 509-516
- Citations
- 1808
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1808
OpenAlex
Cite This
Akers
(1978).
Binary Decision Diagrams.
IEEE Transactions on Computers
, C-27
(6)
, 509-516.
https://doi.org/10.1109/tc.1978.1675141
Identifiers
- DOI
- 10.1109/tc.1978.1675141