The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - April-June (1997 vol.14)
pp: 51-59
ABSTRACT
<p>Circuit designers can efficiently verify designs at the bit and word levels in one graph-based data structure. The authors present the representation technique, manipulation algorithms for K*BMDs, and experimental results comparing them with other data structures.</p>
CITATION
Rolf Drechsler, Bernd Becker, Stefan Ruppertz, "The K*BMD: A Verification Data Structure", IEEE Design & Test of Computers, vol.14, no. 2, pp. 51-59, April-June 1997, doi:10.1109/54.587742
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool