Functional verification for retiming and rebuffering optimization

An algorithm which proves or disproves functional consistency of a sequential datapath after a combination of retiming, pipelining and buffering optimizations is presented. The verification algorithm is complete and efficient. It includes verification of external latency constraints. Experiments have confirmed the speed of the implemented algorithm and errors were clearly indicated in industrial designs.<
>