Polynomial Formal Verification of Complex Multipliers
Conference: MBMV 2022 - 25. Workshop MBMV
02/17/2022 - 02/18/2022 at online
Proceedings: ITG-Fb. 302: MBMV 2022
Pages: 4Language: englishTyp: PDF
Authors:
Mahzoon, Alireza (Institute of Computer Science, University of Bremen, Bremen, Germany)
Drechsler, Rolf (Institute of Computer Science, University of Bremen, Bremen, Germany & Cyber-Physical Systems, DFKI GmbH, Bremen, Germany & Cyber-Physical Systems, DFKI GmbH, Bremen, Germany)
Abstract:
In recent years, several formal verification methods based on Symbolic Computer Algebra (SCA) have been proposed to verify complex multipliers. Despite this progress, the complexity of these methods is usually unknown. It raises serious questions regarding the scalability of SCA-based approaches. In this paper, we propose a verification method based on SCA and Binary Decision Diagrams (BDDs) to guarantee the polynomial formal verification of complex multipliers.