Title :
Arithmetic transforms for verifying compositions of sequential datapaths
Author :
Radecka, Katarzyna ; Zilic, Zeljko
Author_Institution :
McGill Univ., Montreal, Que., Canada
fDate :
6/23/1905 12:00:00 AM
Abstract :
We address the issue of obtaining compact canonical representations of datapath circuits with sequential elements, for the purpose of equivalence checking. First, we demonstrate the mechanisms for efficient compositional construction of arithmetic transform (AT), which is the underlying function representation, used in modern word-level decision diagrams. Next, we introduce a way of generating the canonical transforms of the sequential datapath circuits. Using these principles, we verify by AT the highly sequential distributed arithmetic architectures
Keywords :
Boolean functions; distributed arithmetic; logic testing; sequential switching; Boolean functions; arithmetic transform; datapath arithmetic circuits; digital signal processing datapaths; graph representations; sequential datapaths; sequential distributed arithmetic; Adders; Arithmetic; Boolean functions; Data structures; Digital signal processing; Field programmable gate arrays; Intellectual property; Polynomials; Sequential circuits; Transforms;
Conference_Titel :
Computer Design, 2001. ICCD 2001. Proceedings. 2001 International Conference on
Conference_Location :
Austin, TX
Print_ISBN :
0-7695-1200-3
DOI :
10.1109/ICCD.2001.955050