Skip to Main Content
We address verification of imprecise datapath circuits with sequential elements. Using the arithmetic transform (AT) and its extensions, we verify the sequential datapath circuits with finite precision. An efficient formulation of precision verification is presented as a polynomial maximization search over Boolean inputs. Using a branch-and-bound search for the precision error and the block-level composition of ATs, we verify the approximated, rounded and truncated pipelined datapaths.