Téléchargez le livre : Polynomial Formal Verification of Approximate Functions

Polynomial Formal Verification of Approximate Functions

de

Éditeur :

Springer Vieweg


Collection :

BestMasters

Paru le : 2023-07-22

eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
105,99 €
Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

badge apple Application Louise Reader
badge Android Application Louise Reader
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.
Pages
79 pages
Collection
BestMasters
Parution
2023-07-22
Marque
Springer Vieweg
EAN papier
9783658418878
EAN PDF
9783658418885
Informations sur l'ebook
Nombre pages copiables
0
Nombre pages imprimables
7
Taille du fichier
6584 Ko
Prix
105,99 €
EAN EPUB
9783658418885
Informations sur l'ebook
Nombre pages copiables
0
Nombre pages imprimables
7
Taille du fichier
8172 Ko
Prix
105,99 €

Suggestions personnalisées