Module Selection And Data Format Conversion For Cost-optimal Dsp Synthesis

In high level synthesis each node of a synchronous dataflow graph (DFG) is scheduled to a specific time and allocated to a processor. In this paper we present new integer linear programming (ILP) models which generate a blocked schedule for a DFG with implicit retiming, pipelining, and unfolding while performing module selection and data format conversion. A blocked schedule is a schedule which overlaps multiple iterations of the DFG to guarantee a minimum number of processors. Component modules are selected from a library of processors to minimize cost. Furthermore, we include data format converters between processors of different data formats. In addition, we minimize the unfolding factor of the blocked schedule.

[1]  Catherine H. Gebotys.  Synthesis of throughput-optimized multichip architectures , 1993, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '93.

[2]  Yu-Chin Hsu,et al.  A formal approach to the scheduling problem in high level synthesis , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Markku Renfors,et al.  The maximum sampling rate of digital filters under hardware speed constraints , 1981 .

[4]  Sudhir Ahuja,et al.  Effective Pipelining of Digital Systems , 1978, IEEE Transactions on Computers.

[5]  Keshab K. Parhi,et al.  Resource-constrained loop list scheduler for DSP algorithms , 1995, J. VLSI Signal Process..

[6]  Pierre G. Paulin,et al.  Force-directed scheduling for the behavioral synthesis of ASICs , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Mohamed I. Elmasry,et al.  Global optimization approach for architectural synthesis , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  G. De Micheli,et al.  A module selection algorithm for high-level synthesis , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[9]  Sabih H. Gerez,et al.  Range-chart-guided iterative data-flow graph scheduling , 1992 .

[10]  Keshab K. Parhi,et al.  Static Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum Unfolding , 1991, IEEE Trans. Computers.

[11]  David A. Kendrick,et al.  GAMS : a user's guide, Release 2.25 , 1992 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Alice C. Parker,et al.  The high-level synthesis of digital systems , 1990, Proc. IEEE.

[14]  Keshab K. Parhi.  A systematic approach for design of digit-serial signal processing architectures , 1991 .

[15]  Charles E. Leiserson,et al.  Optimizing Synchronous Circuitry by Retiming (Preliminary Version) , 1983 .

[16]  A. H. Timmer,et al.  Execution interval analysis under resource constraints , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[17]  Miodrag Potkonjak,et al.  Fast prototyping of datapath-intensive architectures , 1991, IEEE Design & Test of Computers.

[18]  Keshab K. Parhi,et al.  Generalized ILP scheduling and allocation for high-level DSP synthesis , 1993, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '93.

[19]  Keshab K. Parhi,et al.  Data-flow transformations for critical path time reduction in high-level DSP synthesis , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  Catherine H. Gebotys,et al.  Optimal mapping of DSP application to architectures , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[21]  L. Thiele,et al.  Synthesis methods for domain-specific multiprocessor systems including memory design , 1993, Proceedings of IEEE Workshop on VLSI Signal Processing.

[22]  E. F. Girczyc,et al.  Loop winding--a data flow approach to functional pipelining , 1987 .

[23]  Yu-Chin Hsu,et al.  Zone scheduling , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[24]  Alice C. Parker,et al.  Sehwa: a software package for synthesis of pipelines from behavioral specifications , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..