Polynomial Formal Verification Of Approximate Functions

Download or read book Polynomial Formal Verification of Approximate Functions written by Martha Schnieber and published by Springer Nature. This book was released on 2023-08-23 with total page 87 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.