Cantitate/Preț
Produs

Polynomial Formal Verification of Approximate Functions: BestMasters

Autor Martha Schnieber
en Limba Engleză Paperback – 23 iul 2023
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.
Citește tot Restrânge

Din seria BestMasters

Preț: 63009 lei

Preț vechi: 74129 lei
-15% Nou

Puncte Express: 945

Preț estimativ în valută:
12058 12440$ 10206£

Carte tipărită la comandă

Livrare economică 04-18 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783658418878
ISBN-10: 3658418877
Ilustrații: X, 79 p. 40 illus. Textbook for German language market.
Dimensiuni: 148 x 210 mm
Greutate: 0.13 kg
Ediția:1st ed. 2023
Editura: Springer Fachmedien Wiesbaden
Colecția Springer Vieweg
Seria BestMasters

Locul publicării:Wiesbaden, Germany

Cuprins

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

Notă biografică

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

Textul de pe ultima copertă

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.