Efficient unfolding procedure for DSP applications

Abstract

An FSFG can be used to obtain a rate-optimal schedule. There are some criteria to measure the optimality. Normally, an iteration period bound (IPB) is used for the optimal implementation. If an iteration period (IP) is the same as the IPB, the schedule is called rate-optimal. Unfolding can reduce the IP and guarantee rate-optimal schedules with an optimum unfolding factor. A new unfolding procedure, called JK's unfolding, is introduced which has low complexity and can be described using graphical methods.