Polynomial Formal Verification of Approximate Functions
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.
1143464166
Polynomial Formal Verification of Approximate Functions
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.
119.99 In Stock
Polynomial Formal Verification of Approximate Functions

Polynomial Formal Verification of Approximate Functions

by Martha Schnieber
Polynomial Formal Verification of Approximate Functions

Polynomial Formal Verification of Approximate Functions

by Martha Schnieber

Paperback(1st ed. 2023)

$119.99 
  • SHIP THIS ITEM
    In stock. Ships in 6-10 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

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.

Product Details

ISBN-13: 9783658418878
Publisher: Springer Fachmedien Wiesbaden
Publication date: 07/23/2023
Series: BestMasters
Edition description: 1st ed. 2023
Pages: 79
Product dimensions: 5.83(w) x 8.27(h) x (d)

About the Author

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

Table of Contents

Introduction.- Preliminaries.- RelatedWork.- PolynomialVerification.- Experiments.- Conclusion.
From the B&N Reads Blog

Customer Reviews