DMCA
Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs (2006)
Cached
Download Links
| Venue: | IEEE Trans. on Computers |
| Citations: | 14 - 10 self |
BibTeX
@ARTICLE{Ciesielski06expansiondiagrams:,
author = {Maciej Ciesielski and Priyank Kalla and Serkan Askar},
title = {Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs},
journal = {IEEE Trans. on Computers},
year = {2006},
volume = {55},
pages = {1188--1201}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Taylor Expansion Diagram (TED) is a compact, wordlevel, canonical representation for data flow computations that can be expressed as multi-variate polynomials. TEDs are based on a decomposition scheme using Taylor series expansion that allows to model word-level signals as algebraic symbols. This power of abstraction, combined with canonicity and compactness of TED, makes it applicable to equivalence verification of dataflow designs. The paper describes the theory of TEDs and proves their canonicity. It shows how to construct a TED from a HDL design specification and discusses application of TEDs in proving equivalence of such designs. Experiments were performed with a variety of designs to observe the potential and limitations of TEDs for dataflow design verification. Application of TEDs to algorithmic and behavioral verification is demonstrated. I.
Keyphrases
canonical representation expansion diagram data flow design algebraic symbol taylor series expansion hdl design specification multi-variate polynomial taylor expansion diagram behavioral verification data flow computation word-level signal decomposition scheme dataflow design verification dataflow design
