and Minimal Trellises John Lafferty School of Computer Science Carnegie...  Home/Search
Context
Related
| cmu.edu/~lafferty/pub/bddfinal.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~lafferty/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 C be a binary code of length n, and let f C (x 1 ; : : : ; x n ) be ... (Update)
Active bibliography (related documents): More All
8.7: Ordered Binary Decision Diagrams and Minimal Trellises - Lafferty, Vardy (1998) (Correct)
1.1: Interleaver Properties and Their Applications to.. - Garello.. (2001) (Correct)
0.9: Computational Methods in Coding Theory - Trachtenberg (1996) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ trellises-ordered,
author = "And Minimal Trellises",
title = "Ordered Binary Decision Diagrams",
url = "citeseer.ist.psu.edu/751665.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1726 Graph-based algorithms for boolean function manipulations - Bryant - 1986
559 Near Shannon limit error-correcting coding and decoding: tur.. (context) - Berrou, Glavieux et al. - 1993
510 Symbolic boolean manipulation with ordered binary decision d.. - Bryant - 1992
442 Optimal decoding of linear codes for minimizing symbol error.. (context) - Bahl, Cocke et al. - 1974
328 A maximum likelihood approach to continuous speech recogniti.. (context) - Bahl, Jelinek et al. - 1983
316 Efficient implementation of a BDD package (context) - Brace, Rudell et al. - 1990
313 The Viterbi algorithm (context) - Forney - 1973
275 Dynamic variable ordering for ordered binary decision diagra.. (context) - Rudell - 1993
181 Algebraic decision diagrams and their application - Bahar, Frohm et al. - 1993
173 the complexity of VLSI implementations and graph representat.. - Bryant - 1991
157 Maximum-likelihood sequence estimation of digital sequences .. (context) - Forney - 1972
143 Sequential circuit verification using symbolic model checkin.. (context) - Burch, Clarke et al. - 1990
142 Factor graphs and the sum-product algorithm - Kschischang, Frey et al. - 1998
133 Good error-correcting codes based on very sparse matrices - MacKay - 1999
126 Binary decision diagrams (context) - Akers - 1978
115 Graphical Models for Machine Learning and Digital Communicat.. (context) - Frey - 1998
90 Improving the variable ordering of OBDDs is NPcomplete (context) - Bollig, Wegener - 1996
88 A recursive approach to low-complexity codes (context) - Tanner - 1981
87 Verification of arithmetic functions with binary moment diag.. - Bryant, Chen - 1995
82 Efficient representation and manipulation of switching funct.. (context) - Drechsler, Sarabi et al. - 1994
69 Representation of switching circuits by binary decision prog.. (context) - Lee - 1959
67 The synthesis of two-terminal switching circuits (context) - Shannon - 1949
63 The generalized distributive law (context) - Aji, McEliece - 1998
61 A new multilevel coding method using error-correcting codes (context) - Imai, Hirakawa - 1977
60 Multi-terminal binary decision diagrams: An efficient data s.. (context) - Clarke, Fujita et al. - 1993
58 Expander codes - Sipser, Spielman - 1996
55 Codes and iterative decoding on general graphs (context) - Wiberg, Loeliger et al. - 1995
54 Hybrid decision diagrams --- overcoming the limitations of M.. - Clarke, Fujita et al. - 1995
53 Binary decision diagrams and beyond: Enabling technologies f.. - Bryant - 1995
49 Edge-valued binary decision diagrams for multi-level hierarc.. (context) - Lai, Sastry - 1992
35 the OBDD-representation of general Boolean functions (context) - Liaw, Lin - 1992
32 Minimal trellises for block codes (context) - Muder - 1988
25 the BCJR trellis for linear block codes (context) - McEliece - 1996
25 Verification of sequential machines based on symbolic execut.. (context) - Coudert, Berthet et al. - 1989
21 the trellis structure of block codes - Kschischang, Sorokine - 1924
20 Minimal tail-biting trellises: the Golay code and more (context) - Calderbank, Forney et al. - 1999
19 High performance BDD package based on exploiting memory hier.. - Ranjan, Sanghavi et al. - 1996
18 Formal verification of a PowerPC microprocessor - Appenzeller, Kuehlmann - 1995
18 The intractability of computing the minimum distance of a co.. (context) - Vardy - 1997
16 Trellis structure of codes (context) - Vardy - 1998
16 Foundation and methods of channel encoding (context) - Massey - 1978
14 Coset codes II: Binary lattices and related codes (context) - Forney - 1988
14 A logically complete reasoning maintenance system based on a.. - Madre, Coudert - 1991
13 the optimum bit orders with respect to the state complexity .. (context) - Kasami, Takata et al. - 1993
12 MORE: Alternative implementation of BDDpackages by multi-ope.. - Hett, Drechsler et al. - 1996
9 Multilevel logic based on functional decision diagrams (context) - Kebschull, Schubert et al. - 1992
9 Trellis decoding complexity of linear block codes (context) - Kiely, Dolinar et al. - 1996
9 Lower bounds on trellis complexity of block codes (context) - Lafourcade, Vardy - 1938
9 How many decomposition types do we need - Becker, Drechsler - 1995
8 Construction of minimal tail-biting trellises (context) - Kotter, Vardy - 1998
7 personal communication (context) - Bryant - 1997
6 Asymptotically good codes have infinite trellis complexity (context) - Lafourcade, Vardy - 1995
6 Optimal sectionalization of a trellis (context) - Lafourcade, Vardy - 1996
6 The trellis structure of maximal fixed-cost codes - Kschischang - 1996
5 Final report on a coding system design for advanced solar mi.. (context) - Forney - 1967
5 Soft decoding techniques for codes and lattices, including t.. - Conway, Sloane - 1986
5 Proof of a conjecture of McEliece regarding the expansion in.. (context) - Vardy, Kschischang - 2027
5 the intractability of permuting a block code to minimize tre.. - Horn, Kschischang - 2042
5 Dimension/length profiles and trellis complexity of linear b.. (context) - Forney - 1994
5 Multilingual dictionary: System theory, coding theory, symbo.. (context) - Forney, Marcus et al. - 1995
5 Complexity theoretical aspects of OFDDs - Bollig, Lobbing et al. - 1996
4 The size of reduced OBDDs and optimal read-once branching pr.. (context) - Wegener - 1994
4 Boolean resubstitution with permissible functions and binary.. (context) - Sato, Yasue et al. - 1990
3 Size and structure of random OBDDs - Gropl, Promel et al. - 1997
3 Application of Hidden Markov Models to Text and Speech (context) - Ferguson, Proc - 1980
3 Boston: Kluwer Academic Publishers (context) - Brown, Reasoning - 1990
3 Minimality of factor graphs (context) - Kotter, Vardy - 1998
3 Satisfiability problems for OFDDs (context) - Wercherner, Harich et al. - 1996
3 the rectangularity of nonlinear block codes (context) - Sidorenko, Martin et al. - 1999
2 Factor graphs: classification, constructions, and bounds (context) - Kotter, Vardy - 1998
2 Division, Pentium style: An analysis of Intel's mistake(s (context) - Bryant - 1995
2 Trellis complexity and soft-decision decoding: Conventional .. (context) - Vardy - 1997
2 art of trellis decoding (context) - Jain, Mandoiu et al. - 1998
2 The dynamics of group codes: state spaces, trellises and can.. (context) - Forney, Trott - 1993
2 Two-step trellis decoding of partial unit memory convolution.. (context) - Hole - 1997
1 Entropy/length profiles, bounds on the minimal covering of b.. (context) - Reuven, Be'ery - 1998
1 K*BMDs: A new data structure for verification (context) - Drechsler, Becker et al. - 1996
1 Delay fault test generation for scan/hold circuits using boo.. (context) - Bhattacharya, Agrawal et al. - 1992
Documents on the same site (http://www.cs.cmu.edu/~lafferty/publications.html): More
Spectral Techniques for Expander Codes - Lafferty, Rockmore (1997) (Correct)
Level Spacings For Cayley Graphs - Lafferty, Rockmore (Correct)
Spectral Techniques for Expander Codes and Generalized Cyclic .. - Lafferty, Rockmore (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC