On retiming of multirate dsp algorithms

In the paper retiming of DSP algorithms exhibiting mul tirate behavior is treated Using the nonordinary marked graph model and the reachability theory we provide a new condition for valid retiming of multirate graphs We show that for a graph with n nodes the reachability condition can be split into the reachability condition for the topolo gicallyequivalent unitrate graph all rates set to one and n n ratedependent conditions Using this property a class of equivalent graphs of reduced complexity is introdu ced which are equivalent in terms of retiming Additionally the circuitbased necessary condition for valid retiming of multirate graphs is extended for the su cient par