Polynomial Formal Verification of Approximate Functions / BestMasters (PDF)
(Sprache: Englisch)
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,...
sofort als Download lieferbar
Printausgabe 106.99 €
eBook (pdf) -10%
96.29 €
48 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Polynomial Formal Verification of Approximate Functions / BestMasters (PDF)“
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.
About the author
Martha Schnieber is working as a research assistant in the Group ofComputer Architecture at the University of Bremen.
Autoren-Porträt von Martha Schnieber
About the author Martha Schnieber is working as a research assistant in the Group of Computer Architecture at the University of Bremen.
Bibliographische Angaben
- Autor: Martha Schnieber
- 2023, 1st ed. 2023, 79 Seiten, Englisch
- Verlag: Springer Fachmedien Wiesbaden
- ISBN-10: 3658418885
- ISBN-13: 9783658418885
- Erscheinungsdatum: 22.07.2023
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 6.28 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "Polynomial Formal Verification of Approximate Functions / BestMasters"
0 Gebrauchte Artikel zu „Polynomial Formal Verification of Approximate Functions / BestMasters“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Polynomial Formal Verification of Approximate Functions / BestMasters".
Kommentar verfassen