Architectural Synthesis for DSP Silicon Compilers

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 8, Issue 4, 1989, Pages 431-447

  Haroun, Baher S ^a   Elmasry, Mohamed I ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE--MICROPROGRAMMING; INTEGRATED CIRCUITS, VLSI--LAYOUT; LOGIC DESIGN;

DSP ALGORITHM AUTOMATED MAPPING; DSP SILICON COMPILERS; GENERALIZED SIGNAL FLOW GRAPH; SOFTWARE PACKAGE SPAID;

SIGNAL PROCESSING;

EID: 0024645923     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.29596     Document Type: Article

References (52)

1. D. Gajski, Silicon Compilation. Reading, MA: Addison-Wesley, 1988.
2. J. Rabaey, S. Pope, and R. Brodersen, “An integrated automatic layout generation system,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 285–296, July 1985.
3. P. Ruetz et al., “Computer generation of digital filter banks,” IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 256–265, Apr. 1986.
4. J. Schuck, M. Glesner, and M. Lacken, “First results and design experience with silicon compiler ALGIC,” in VLSI Signal Processing II. New York: IEEE Press, Nov. 1986.
5. B. Petersen, B. White, D. Solomon, and M. Elmasry, “SPIL: A silicon compiler with performance evaluation,” in Proc. ICCAD, pp. 500–503, Nov. 1986.
6. P. Paulin, J. Knight, and E. Gyrczyc, “HAL: A multi-paradigm approach to automatic data path synthesis,” in Proc. 23rd Design Automation Conf., pp. 263–270, 1986.
7. N. Park and A. Parker, “Sehwa: A software package for synthesis of pipelines from behavioral specifications,” IEEE Trans. Computer-Aided Design, vol. 7, pp. 356–370, Mar. 1988.
8. M. McFarland, “Using bottom up design techniques in synthesis of digital hardware from abstract behavioral descriptions,” in Proc. 23rd Design Automation Conf., pp. 474–480, 1986.
9. C. Gebotys and M.I. Elmasry, “VLSI design synthesis with testability,” in Design Automated Conf., 1988.
10. A. Parker, J. Pizarro, and M. Mlinon, “MAHA: A program for data path synthesis,” in 23rd Design Automation Conf. 86, pp. 461–466, 1986.
11. B. Pangrie and D. Gajski, “State synthesis & connectivity binding for microarchitecture compilation,” in Proc. ICCAD86, Nov. 1986.
12. G. Goesens et al., “A CAD methodology for mapping DSP Algorithms onto MP custom architectures,” in Proc. IEEE ICCAS 86, May 1986.
13. J. Rabaey, H. De Man, J. Vanhoof, G. Goosens, and F. Catthoor, “CATHEDRAL-II: A synthesis system for multiprocessor DSP systems,” in Silicon Compilation, D. Gajsk, Ed. Reading, MA: Addison-Wesley, pp. 311–360, 1988.
14. M. Hatamian and G. Cash, “Parallel bit-level pipelined VLSI design for high speed signal processing,” Proc. IEEE, vol. 75, pp. 11921202, Sept. 1987.
15. A. Fisher and H. Kung, “Synchronizing large VLSI processor arrays,” IEEE Trans. Computers, vol. C-33, pp. 734–740, Aug. 1985.
16. J. Allen, “Computer architecture for DSP,” Proc. IEEE, vol. 73, pp. 852–873, May 1985.
17. A. Fettweis, “Realisability of digital filter networks,” AEU, vol. 30, 1976.
18. E.A. Lee and D.G. Messerschmitt, “Synchronous data flow,” Proc. IEEE, vol. 75, pp. 1235–1245, Sept. 1987.
19. B. Haroun and M.I. Elmasry, “SPAID,” Tech. Rep. UW/ICR 88–06, Univ. Waterloo, Canada, 1988.
20. C. Tseng and P. Seviourek, “Automated synthesis of data paths in digital systems,” IEEE Trans. Computer-Aided Design, pp. 379–395, July 1986.
21. T. Barnwell III and D. Schwarz, “Optical implementation of flow graphs on synchronous multiprocessors,” in Int. Conf. on ASSP 84. 1984.
22. D. Schwartz and T. Barnwell III, “Cyclo static solution: Optimal multipr realisation of recursive algorithms.” in VLSI Signal Processing II. New York: IEEE Press. Nov. 1986.
23. F. Rose, C. Lciscrson, and J. Saxe, “Optimising synchronous circuitry by retiming.” in Proc. Caltech Conf on VLSI. pp. 41–67. Computer Sci. Press. 1983.
24. L. Glasser and D. Dobberpuhl, The Design and Analysis of VLSI Circuits. Reading. MA: Addison-Wesley. 1985.
25. D. Schwartz and T. Barnwell III. “A graph theoretic technique for the generation of systolic implementation.” in Proc. Asilomar Conf. on CAS 84. 1984
26. B. Kernighan and S. Lin. “An eflicient heuristic procedure for partitioning graphs.” Bell Syst. Tech. J. pp. 291–307, Feb. 1970.
27. A. Aho, R. Sethi, and J. Ullman. Compilers. Reading, MA: AddisonWesley, 1986.
28. H. Lipp. “Methodical aspects of logic synthesis.” Proc. IEEE. vol. 71, vol. pp. 88–97. Jan. 83.
29. J. Bhasker. “An optimizer for hardware synthesis.” Scientific Honeyweller, pp. 23–34, Winter 1987.
30. H. Trickey, “Flamel: A highlevel hardware compiler.” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 259–269, Mar. 1987.
31. K. Hwang. Computer Arithmetic. New York: Wiley. 1979.
32. C. Seitz. “System timing.” in Introduction to VLSI Systems. C. Mead and L. Conway, Eds. Reading, MA: Addison-Wesley, 1981.
33. M. Pechoucek. “Anomalous response times of input synchronizers.” IEEE Trans. Computers, vol. C-25, pp. 133–139. Feb. 1976.
34. C. Leiserson and J. Saxe. “Optimising synchronous systems.” J. VLSI & Comp. Syst., vol. 1. no. 1. pp. 41–67. 1983.
35. A. Yakovlev, “Designing self timed systems.” VLSI System Design. pp. 70–86, Sept. 1985.
36. S.Y. Kung, VLSI Array Processors. Englewood Clifts. NJ: Prentice Hall. 1988.
37. Michael Garey and David Johnson Computers and Intractability. San Francisco. CA: Freeman. New- York, 1979.
38. E.G. Coffman. Computer and Joh-Shop Scheduling Theory. New York: Wiley, 1976.
39. T.C. Hu. “Parallel sequencing and assemblv line problems.” Oper. Res., vol. 9, pp. 841–848. 1961.
40. P. Paulin and J. Knight, “Force-directed scheduling in automatic data path synthesis,” in ACM/IEEE 24th DAC, 1987.
41. E. Rich, Artificial Intelligence. New York: McGraw-Hill, 1983.
42. Claude Berge, Graphs. New York: Elsevier Sci., 1985.
43. H. Gabow and O. Kariv. “Algorithms for edge coloring bipartite graphs and multigraphs.” SIAM J. Comput. vol. 11, pp. 117–129, Feb. 1982.
44. Martin Golumbic. Algorithmic Graph Theory and Perfect Graphs. New York: Academic. 1980.
45. B. Kernighan. D. Schweikert. and G. Persky. “An optimum channel routing algorithm for polycell layouts of integrated circuits.” in Proc. 10th Design Automation Conf., pp. 50–59, 1973.
46. U. Gupta, D. Lee, and J. Leung, “An optimal solution for channel assignment problem.” IEEE Trans. Computers, vol. C-28. pp. 807–8loT Nov. 1979.
47. A. Tucker. “Coloring a family of circular arc graphs.” SIAM J. Appl. Math., vol. 29. pp. 493. 502 (1975).
48. P. Paulin and J. Knight. “Scheduling and allocation for pipelined asics.” in CCVLSI 87, Oct. 1987.
49. S.Y. Kung, H. Whitehouse, and T. Kailath. VLSI & Modern Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1985.
50. ACM/IEEE Workshop on High Level Synthesis. Orcas Island. Jan. 1988.*
51. B.M. Pangrle. “Splicer: A heuristic approach to connectivity binding.” in 25th DAC, pp. 536–541. 1988.
52. M. Kubo et al., “Perspective on BiCMOS VLSI.” IEEE J. Solid-State Circuits, vol. 23. Feb. 1988.