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.
99.0
In Stock
5
1
Polynomial Formal Verification of Approximate Functions
Polynomial Formal Verification of Approximate Functions
eBook (1st ed. 2023)
$99.00
Related collections and offers
99.0
In Stock
Product Details
| ISBN-13: | 9783658418885 |
|---|---|
| Publisher: | Springer Vieweg |
| Publication date: | 07/22/2023 |
| Series: | BestMasters |
| Sold by: | Barnes & Noble |
| Format: | eBook |
| File size: | 9 MB |
About the Author
From the B&N Reads Blog