Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Polynomial Formal Verification of Approximate Functions

Polynomial Formal Verification of Approximate Functions

Schnieber, Martha

Paperback

Series: Bestmasters

Technology & EngineeringAlgebraGeneral Mathematics

ISBN10: 3658418877
ISBN13: 9783658418878
Publisher: Springer Vieweg
Published: Jul 23 2023
Pages: 79
Weight: 0.29
Height: 0.22 Width: 5.83 Depth: 8.27
Language: 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.

Also in

Technology & Engineering

View All