An efficient method to compute Arithmetic Transforms for datapath by module compositions

This paper considers the construction of Arithmetic Transform (AT) and its extensions, which is a technique to express word-level representations of combinational and sequential blocks for datapath circuits. The goal is for hardware verification and component matching. Module composition is helpful to process a block-level netlist representing a complex circuit and to obtain its transform efficiently. To facilitate the composition, several subroutines are proposed, and integrated them into an efficient topology algorithm.