Abstract
In this paper we propose a generalized technique to count the required number of registers in a schedule which supports overlapped scheduling and can be applied to the case where a general digit-serial data format is used. This technique is integrated into an integer linear programming (ILP) model for time-constrained scheduling. In the ILP model, appropriate processors of certain data formats are chosen from a library of processors and data format converters are automatically inserted between processors of different data formats if necessary. Then the required number of registers for each data format is evaluated correctly by the proposed technique. Hence an optimal architecture for a given digital signal processing algorithm is synthesized where the cost of registers as well as the cost of processors and data format converters are minimized. It is shown that by including the cost of registers in the synthesis task as proposed in this paper leads to up to 12.8% savings in the total cost of the synthesized architecture when compared with synthesis performed without including the register cost in the total cost.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.C. McFarland, A.C. Parker, and R. Camposano, “The highlevel synthesis of digital systems,” Proc. of the IEEE, Vol. 78, pp. 301-318, Feb. 1990.
C.-T. Hwang, J.-H. Lee, and Y.-C. Hsu, “A formal approach to the scheduling problem in high level synthesis,” IEEE Trans. Computer-Aided Design, Vol. CAD-10, pp. 464-475, April 1991.
C.H. Gebotys and M.I. Elmasry, “Optimal synthesis of highperformance architectures,” IEEE Journal of Solid-State Circuits, Vol. 27, pp. 389-397, March 1992.
C.H. Gebotys, “Synthesis of throughput-optimized multichip architectures,” in Proc. IEEE Custom Integrated Circuits Conf., San Diego, May 1993, pp. 5.2.1-5.2.4.
C.H. Gebotys and R.J. Gebotys, “Optimal mapping of DSP applications to architectures,” in Proc. 26th Hawaii Int. Conf. System Sciences, pp. 116-123, 1993.
C.H. Gebotys and M.I. Elmasry, “Global optimization approach for architecture synthesis,” IEEE Trans. Computer-Aided Design, Vol. CAD-12, pp. 1266-1278, Sept. 1993.
C.-T. Hwang and Y.-C. Hsu, “Zone scheduling,” IEEE Trans. Computer-Aided Design, Vol. CAD-12, pp. 926-934, July 1993.
L.E. Lucke and K.K. Parhi, “Generalized ILP scheduling and allocation for high-level DSP synthesis,” in Proc. IEEE Custom Integrated Circuits Conf., San Diego, pp. 5.4.1-5.4.4, May 1993.
A. Bachmann, M. SchÖbinger, and L. Thiele, “Synthesis methods for domain specific multiprocessor systems including memory design,” in VLSI Signal Processing, VI, pp. 417-425, 1993.
S. Chaudhuri and R.A. Walker, “ILP-based scheduling with time and resource constraints in high level synthesis,” in Proc. IEEE 7th Int. Conf. VLSI Design, pp. 17-20, Jan. 1994.
R. Jain, F. Catthoor, J. Vanhoof, B.J.S. De Loore, G. Goossens, N.F. Goncalvez, L.J.M. Claesen, J.K.J. Van Ginderdeuren, J. Vandewalle, and H.J. De Man, “Custom design of a VLSI PCM-FDM transmultiplexer from system specifications to circuit layout using a computer-aided design system,” IEEE Trans. Circuits Syst., Vol. CAS-33, pp. 183-195, Feb. 1986.
R.I. Hartley and J.R. Jasica, “Behavioral to structural translation in a bit-serial silicon compiler,” IEEE Trans. Computer-Aided Design, Vol. CAD-7, pp. 877-886, Aug. 1988.
H. De Man, F. Catthoor, et al., “Architecture driven synthesis techniques for VLSI implementation of DSP algorithms,” Proceedings of the IEEE, Vol. 78, pp. 319-335, Feb. 1990.
K. Ito, L.E. Lucke, and K.K. Parhi, “Module selection and data format conversion for cost-optimal DSP synthesis,” in Proc. ACM/IEEE Int. Conf. on Computer-Aided Design, San Jose, Nov. 1994, pp. 322-329.
K. Ito and K.K. Parhi, “Register minimization in cost-optimal synthesis of DSP architectures,” in Proc. 1995 IEEE VLSI Signal Processing Workshop, Sakai, Oct. 1995, pp. 207-216.
P.G. Paulin and J.P. Knight, “Force-directed scheduling for the behavioral synthesis of ASIC's,” IEEE Trans. Computer-Aided Design, Vol. CAD-8, pp. 661-679, June 1989.
C.-Y. Wang and K.K. Parhi, “Loop list scheduler for DSP algorithms under resource constraints,” in Proc. IEEE Int. Symp. Circuits and Systems, Chicago, May 1993, pp. 1662-1665.
R. Hartley and P. Corbett, “Digit-serial processing techniques,” IEEE Trans. Circuits Syst., Vol. CAS-37, pp. 707-719, June 1990.
K.K. Parhi, “A Systematic approach for design of digit-serial processing architecture,” IEEE Trans. Circuits Syst., Vol. CAS-38, pp. 358-375, April 1991.
K.K. Parhi, “Systematic synthesis of DSP data format converters using life-time analysis and forward-backward register allocation,” IEEE Trans. Circuits Syst.-II: Analog and Digital Signal Processing, Vol. CAS-39, pp. 423-440, July 1992.
A. Brooke, D. Kendrick, and A. Meeraus, GAMS: A User's Guide, Release 2.25. South San Francisco, CA: The Scientific Press, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ito, K., Parhi, K.K. A Generalized Technique for Register Counting and its Application to Cost-Optimal DSP Architecture Synthesis. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 16, 57–72 (1997). https://doi.org/10.1023/A:1007912318193
Published:
Issue Date:
DOI: https://doi.org/10.1023/A:1007912318193