loading...
Verifying Imprecisely Working Arithmetic Circuits
Munich, Germany March 09-March 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DATE.1999.761098Design, Automation and Test in Europe ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
If real number calculations are implemented as circuits, only a limited preciseness can be obtained. Hence, formal verification can not be used to prove the equivalence between the mathematical specification based on real numbers and the corresponding hardware realization. Instead, the number representation has to be taken into account in that certain error bounds have to be verified.For this reason, we propose formal methods to guide the complete design flow of these circuits from the highest abstraction level down to the register-transfer level with formal verification techniques that are appropriate for the corresponding level. Hence, our method is hybrid in the sense that it combines different state-of-the-art verification techniques. Using our method, we establish a more detailed notion of correctness that considers beneath the control and data flow also the preciseness of the numeric calculations. We illustrate the method with the discrete cosine transform as a real-world example.
Citation:
M. Huhn, K. Schneider, Th. Kropf, G. Logothetis, "Verifying Imprecisely Working Arithmetic Circuits," date, pp.65, Design, Automation and Test in Europe (DATE '99), 1999
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions