120 likes | 238 Vues
This study delves into the On-the-Time Scheduling Problem of Uniform Recurrence Equations in VLSI Array Structures for Digital Signal Processing. It defines URE, explains linear, uniform, and affine schedules, and execution time computations. The scheduling vector X is crucial, obtained through solving linear programming problems. A case study involving a complex loop is presented, highlighting execution sequences and insights from linear, uniform, affine, and multi-dimensional scheduling strategies. Examples include Convolution, FIR filter, Selection sort, and a complex loop scenario.
E N D
On the Time Scheduling Problem of Uniform Recurrence Equations Wei-Yang Lin and Tai-Lin Chin ECE 734 VLSI Array Structures for Digital Signal Processing
Uniform Recurrence Equation • URE Definition: where Ex: matrix multiplication AB=C
Affine Schedule: Xip+ci • Execution Time: • Linear schedule: 2N-1. Affine: N
Scheduling Vector X • The scheduling vector X can be obtained by solving a linear programming problem. • Example: Linear Schedule Duality XD1
Multi-dimensional Schedule • Multi-dimensional Uniform Schedule • Multi-dimensional Affine Schedule
Case Study • EX:A complex loop
Conclusion • Linear schedule • Uniform schedule • Affine schedule • Multi-dimensional schedule • Case Study • Convolution • FIR filter • Selection sort • A complex loop case