Polynomial Formal Verification of Approximate Functions (eBook, PDF)

Polynomial Formal Verification of Approximate Functions (eBook, PDF)

Versandkostenfrei!
Sofort per Download lieferbar
81,95 €
inkl. MwSt.
Alle Infos zum eBook verschenken
Weitere Ausgaben:
PAYBACK Punkte
41 °P sammeln!
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 th...

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.