- We will send in 10–14 business days.
/images/books/13926251/9783658418878.jpg)
- Author: Martha Schnieber
- Publisher: Springer Vieweg
- ISBN-10: 3658418877
- ISBN-13: 9783658418878
- Format: 14.8 x 21 x 0.6 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Polynomial Formal Verification of Approximate Functions (e-book) (used book) | bookbook.eu
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.20:04:14
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Martha Schnieber
- Publisher: Springer Vieweg
- ISBN-10: 3658418877
- ISBN-13: 9783658418878
- Format: 14.8 x 21 x 0.6 cm, minkšti viršeliai
- Language: English English
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.
Reviews