Martha Schnieber

Polynomial Formal Verification of Approximate Functions (eBook, PDF)

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Fachmedien Wiesbaden
• Seitenzahl: 79
• Erscheinungstermin: 22. Juli 2023
• Englisch
• ISBN-13: 9783658418885
• Artikelnr.: 68466738

Autorenporträt

About the author

Martha Schnieber is working as a research assistant in the Group of Computer Architecture at the University of Bremen.

Inhaltsangabe

Introduction.- Preliminaries.- RelatedWork.- PolynomialVerification.- Experiments.- Conclusion.

Kundenbewertungen

Bewertung schreiben Bewertung schreiben

Information zu Bewertungen

Zur Abgabe einer Bewertung ist die Anmeldung in Ihrem Kundenkonto notwendig. Die Authentizität der Kundenbewertungen wird von uns nicht überprüft.

Bewertung schreiben Bewertung schreiben