Specifying and verifying imprecise sequential datapaths by Arithmetic Transforms


We address verification of imprecise datapath circuits with sequential elements. Using Arithmetic Transform (AT) and its extensions, we verify the sequential datapath circuits with finite precision. An efficient formulation of the precision verification is presented as a polynomial maximization search over Boolean inputs. Using a branch-and-bound search for… (More)
DOI: 10.1145/774572.774591


4 Figures and Tables