Beschreibung
During the development of digital circuits, their functional correctness has to be ensured, for which formal verification methods have been established. However, the verification process using formal methods can have an exponential time or space complexity, causing the verification to fail. While exponential in general, recently it has been proven that the verification complexity of several circuits is polynomially bounded. Martha Schnieber proves the polynomial verifiability of several approximate circuits, which are beneficial in error-tolerant applications, where the circuit approximates the exact function in some cases, while having a lower delay or being more area-efficient. Here, upper bounds for the BDD size and the time and space complexity are provided for the verification of general approximate functions and several state-of-the-art approximate adders.
Autorenporträt
About the author Martha Schnieber is working as a research assistant in the Group of Computer Architecture at the University of Bremen.
Herstellerkennzeichnung:
Springer Vieweg in Springer Science + Business Media
Abraham-Lincoln-Straße 46
65189 Wiesbaden
DE
E-Mail: juergen.hartmann@springer.com
