Free Delivery Over $100
|
|
|||
|
||||
OverviewDuring 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. Full Product DetailsAuthor: Martha SchnieberPublisher: Springer Fachmedien Wiesbaden Imprint: Springer Vieweg Edition: 1st ed. 2023 Weight: 0.136kg ISBN: 9783658418878ISBN 10: 3658418877 Pages: 79 Publication Date: 23 July 2023 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand  We will order this item for you from a manufactured on demand supplier. Table of ContentsIntroduction.- Preliminaries.- RelatedWork.- PolynomialVerification.- Experiments.- Conclusion.ReviewsAuthor InformationAbout the author Martha Schnieber is working as a research assistant in the Group of Computer Architecture at the University of Bremen. Tab Content 6Author Website:Countries AvailableAll regions |
||||
