Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Soft decoding techniques for codes and Lattices, including the Golay code and the Leech Lattice
IEEE Transactions on Information Theory
Delay fault test generation for scan/hold circuits using Boolean expressions
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Sequential circuit verification using symbolic model checking
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Boolean resubstitution with permissible functions and binary decision diagrams
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
On the OBDD-Representation of General Boolean Functions
IEEE Transactions on Computers
Edge-valued binary decision diagrams for multi-level hierarchical verification
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost all Boolean Functions
IEEE Transactions on Computers
DAC '94 Proceedings of the 31st annual Design Automation Conference
Verification of arithmetic circuits with binary moment diagrams
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Binary decision diagrams and beyond: enabling technologies for formal verification
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
High performance BDD package by exploiting memory hierarchy
DAC '96 Proceedings of the 33rd annual Design Automation Conference
MORE: an alternative implementation of BDD packages by multi-operand synthesis
EURO-DAC '96/EURO-VHDL '96 Proceedings of the conference on European design automation
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Graphical models for machine learning and digital communication
Graphical models for machine learning and digital communication
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Verification of Synchronous Sequential Machines Based on Symbolic Execution
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
How many decomposition types do we need? [decision diagrams]
EDTC '95 Proceedings of the 1995 European conference on Design and Test
K*BMDs: A New Data Structure for Verification
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Formal verification of a PowerPC microprocessor
ICCD '95 Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors
On the trellis structure of block codes
IEEE Transactions on Information Theory - Part 2
Lower bounds on trellis complexity of block codes
IEEE Transactions on Information Theory - Part 2
Optimal sectionalization of a trellis
IEEE Transactions on Information Theory
On the BCJR trellis for linear block codes
IEEE Transactions on Information Theory
Trellis decoding complexity of linear block codes
IEEE Transactions on Information Theory - Part 1
IEEE Transactions on Information Theory - Part 1
The trellis structure of maximal fixed-cost codes
IEEE Transactions on Information Theory - Part 1
Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis
IEEE Transactions on Information Theory - Part 1
On the intractability of permuting a block code to minimize trellis complexity
IEEE Transactions on Information Theory - Part 1
Two-step trellis decoding of partial unit memory convolutional codes
IEEE Transactions on Information Theory
The intractability of computing the minimum distance of a code
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Te “art of trellis decoding” is computationally hard-for large fields
IEEE Transactions on Information Theory
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
On the rectangularity of nonlinear block codes
IEEE Transactions on Information Theory
Minimal tail-biting trellises: the Golay code and more
IEEE Transactions on Information Theory
The generalized distributive law
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Asymptotically good codes have infinite trellis complexity
IEEE Transactions on Information Theory
Hi-index | 14.98 |
Ordered binary decision diagrams (OBDDs) are graph-based data structures for representing Boolean functions. They have found widespread use in computer-aided design and in formal verification of digital circuits. Minimal trellises are graphical representations of error-correcting codes that play a prominent role in coding theory. This paper establishes a close connection between these two graphical models, as follows. Let ${\cal C}$ be a binary code of length $n$, and let $f_{\cal C}(x_1,\ldots,x_n)$ be the Boolean function that takes the value $0$ at $x_1,\ldots,x_n$ if and only if $(x_1,\ldots,x_n) \in {\cal C}$. Given this natural one-to-one correspondence between Boolean functions and binary codes, we prove that the minimal proper trellis for a code ${\cal C}$ with minimum distance $d 1$ is isomorphic to the single-terminal OBDD for its Boolean indicator function $f_{\cal C}(x_1,\ldots,x_n)$. Prior to this result, the extensive research during the past decade on binary decision diagrams驴in computer engineering驴and on minimal trellises驴in coding theory驴has been carried out independently. As outlined in this work, the realization that binary decision diagrams and minimal trellises are essentially the same data structure opens up a range of promising possibilities for transfer of ideas between these disciplines.