Abstract
This paper presents a simulation-based methodology for extracting a simplified view of design functionality from a given module. Such a simplified design view can be used to facilitate test pattern justification from the outputs of the module to the inputs of the module. In this work, we formulate this type of design simplification as a learning problem. By developing a scheme for learning word-level functions, we point out that the core of the problem is to develop an efficient Boolean learner. We discuss the implementation of such a Boolean learner and compare its performance with the one of best-known learning algorithms, the Fourier analysis based method. Experimental results are presented to illustrate the implementation of the simulation-based methodology and its usage for extracting a simplified view of Open RISC 1200 datapath.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aharon, A., et al.: Test Program Generation for Functional Verification of PowerPC Processors in IBM. In: Proc. DAC, pp. 279–285 (1995)
Chen, L., et al.: A Scalable Sofware-Based Self-Test Methodology for Programmable Processors. In: Proc. Design Automation Conf., Anaheim, pp. 548–553 (2003)
Wen, C., et al.: On A Software-Based Self-Test Methodology and Its Application. In: Proc. VLSI Test Symp., Palm Springs (2005)
Wen, C., Wang, L., Chang, K.-T.: Simulation-Based Functional Test Generation for Embedded Processors. To be accepted in IEEE Transaction on Computer (2006)
Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary- Decision Diagrams. ACM Computing Surveys 24(3), 293–318 (1992)
Valiant, L.: A theory of the learnable. Communications of the ACM 27(11), 1134–1142 (1984)
Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)
Kearns, M., et al.: On the learnability of Boolean formulae. In: Proc. 19th Symp. on Theory of Computing, pp. 285–295 (1987)
Kearns, M., Valiant, L.: Learning Boolean formulae or finite automata is as hard as factoring. Technical Report TR-14-88, Harvard University (1988)
Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, Fourier transform, and learnability. J. of ACM 40(3), 607–620 (1993)
Mansour, Y.: Implementation Issues in the Fourier Transform Algorithm. Machine Learning 40, 5–33 (2000)
Park, J., Sandberg, I.W.: Universal approximation using radial-basis-function networks. Neural Computation 3(2), 246–257 (1991)
Ben-Or, M., Tiwari, P.: A deterministic algorithm for sparse multivariate polynomial interpolation. In: Proc. 12th ACM Symp. Theory Comput., pp. 301–309. ACM Press, New York (1988)
Zippel, R.: Interpolating polynomials from their values. J. Symb. Comput. 9(3), 375–403 (1990)
Phillips, G.M.: Interpolation and Approximation by Polynomials. Springer, Heidelberg (2003)
Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. Jour. ACM 27(4), 701–717 (1980)
OpenRISC 1200 at http://www.opencores.org/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Guzey, O., Wen, C., Wang, LC., Feng, T., Miller, H., Abadir, M.S. (2007). Extracting a Simplified View of Design Functionality Based on Vector Simulation. In: Bin, E., Ziv, A., Ur, S. (eds) Hardware and Software, Verification and Testing. HVC 2006. Lecture Notes in Computer Science, vol 4383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70889-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-70889-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70888-9
Online ISBN: 978-3-540-70889-6
eBook Packages: Computer ScienceComputer Science (R0)