An operator-based approach to the unfolding transformation

In this work we develop an operator-based approach suitable to unfold Data Flow Graphs (DFGs) of cyclic shifts of any order. We also show that, as a particular case of the proposed technique, DFGs of non-cyclic shifts can also be unfolded. In both circumstances the technique provides a unifying framework and a compact mathematical formulation that embodies an algorithm amenable to rapidly unfold a variety of DSP programs.