33. The computer program product of claim 31 further comprised of code for reducing the bit-level data flow graph by finding adders, to produce a reduced bit-level data flow graph.
33. The computer program product of claim 31 further comprised of code for reducing the bit-level data flow graph by finding adders, to produce a reduced bit-level data flow graph. 34. The computer program product of claim 33 wherein reducing includes identifying a current slice where the current slice includes partial products or a carry from a previous slice.