Polynomial Formal Verification of Approximate Functions
Aus der Reihe
BestMasters
-
- Taschenbuch ausgewählt
- eBook
-
Sprache:Englisch
Fr. 149.00
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
23.07.2023
Verlag
Springer Fachmedien Wiesbaden GmbHSeitenzahl
79
Maße (L/B/H)
21/14.8/0.6 cm
Gewicht
132 g
Auflage
1st edition 2023
Sprache
Englisch
ISBN
978-3-658-41887-8
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.
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.