skip to content
Ordered binary decision diagrams and minimal trellises Preview this item
ClosePreview this item
Checking...

Ordered binary decision diagrams and minimal trellises

Author: John D Lafferty; Alexander Vardy
Publisher: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1998]
Series: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-98-162.
Edition/Format:   Book : English
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: John D Lafferty; Alexander Vardy
OCLC Number: 40420767
Notes: "July 30, 1998."
Description: 31 p. : ill. ; 28 cm.
Series Title: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-98-162.
Responsibility: John Lafferty, Alexander Vardy.

Abstract:

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[subscript c](x₁, ..., x[subscript n]) be the Boolean function that takes the value 0 at x₁, ..., x[subscript n] if and only if (x₁, ..., x[subscript n]) [element of] C. Given this natural one-to-one correspondence between Boolean functions and binary codes, we prove that the minimal proper trellis for a code C with minimum distance d> 1 is isomorphic to the single-terminal OBDD for its Boolean indicator function f[subscript c](x₁, ..., x[subscript 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."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/40420767>
library:oclcnum"40420767"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/40420767>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:creator
schema:datePublished"1998"
schema:description"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[subscript c](x₁, ..., x[subscript n]) be the Boolean function that takes the value 0 at x₁, ..., x[subscript n] if and only if (x₁, ..., x[subscript n]) [element of] C. Given this natural one-to-one correspondence between Boolean functions and binary codes, we prove that the minimal proper trellis for a code C with minimum distance d> 1 is isomorphic to the single-terminal OBDD for its Boolean indicator function f[subscript c](x₁, ..., x[subscript 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.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/1909847025>
schema:inLanguage"en"
schema:name"Ordered binary decision diagrams and minimal trellises"
schema:numberOfPages"31"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.