Polynomial Formal Verification of Complex Multipliers

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.