Polynomial Formal Verification of Approximate Functions
Produktnummer:
1807af76ea399445c3b24dedff84219aba
| Autor: | Schnieber, Martha |
|---|---|
| Themengebiete: | Approximate Adders Approximate Computing Binary Decision Diagrams Error Metrics Formal Verification Polynomial Verification |
| Veröffentlichungsdatum: | 23.07.2023 |
| EAN: | 9783658418878 |
| Sprache: | Englisch |
| Seitenzahl: | 79 |
| Produktart: | Kartoniert / Broschiert |
| Verlag: | Springer Fachmedien Wiesbaden GmbH |
Produktinformationen "Polynomial Formal Verification of Approximate Functions"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen