Free Download Polynomial Formal Verification of Approximate Functions
English | 2023 | ISBN: 3658418877 | 113 Pages | PDF EPUB (True) | 14 MB
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.
Recommend Download Link Hight Speed | Please Say Thanks Keep Topic Live
NovaFile
kornk.rar.rar
Rapidgator
kornk.rar.rar.html
Nitroflare
kornk.rar.rar
Uploadgig
kornk.rar.rar
Fikper
kornk.rar.rar.html
Links are Interchangeable - Single Extraction