Blick ins Buch

Polynomial Formal Verification of Approximate Functions

Martha Schnieber (Autor)

Buch | Softcover

X, 79 Seiten

2023 | 1st ed. 2023
Springer Fachmedien Wiesbaden GmbH (Verlag)
978-3-658-41887-8 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

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 of Computer Architecture at the University of Bremen.

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

Erscheinungsdatum	25.07.2023
Reihe/Serie	BestMasters
Zusatzinfo	X, 79 p. 40 illus. Textbook for German language market.
Verlagsort	Wiesbaden
Sprache	englisch
Maße	148 x 210 mm
Gewicht	131 g
Themenwelt	Mathematik / Informatik ► Mathematik ► Algebra
	Mathematik / Informatik ► Mathematik ► Analysis
	Technik ► Elektrotechnik / Energietechnik
Schlagworte	Approximate Adders • Approximate computing • binary decision diagrams • Error Metrics • Formal Verification • Polynomial Verification
ISBN-10	3-658-41887-7 / 3658418877
ISBN-13	978-3-658-41887-8 / 9783658418878
Zustand	Neuware