Some new results in the complexity of allocation and binding in data path synthesis

Computers and Mathematics with Applications

Volumn 35, Issue 10, 1998, Pages 93-105

  Mandal, C A ^a   Chakrabarti, P P ^b   Ghose, S ^b  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Allocation; Data path synthesis; High level synthesis; NP complete problems

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; DATA REDUCTION; DATA STORAGE EQUIPMENT; OPTIMIZATION; POLYNOMIALS;

DATA PATH SYNTHESIS; HIGH LEVEL SYNTHESIS;

COMPUTATIONAL COMPLEXITY;

EID: 0032065759     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(98)00076-5     Document Type: Article

References (12)

1. C.J. Tseng and D.P. Siewiorek, Automated synthesis of data paths in digital systems, IEEE Transactions on Computer Aided Design CAD-5, (July 1986).
2. B.M. Pangrle, On the complexity of connectivity binding, IEEE Transactions on Computer Aided Design 10, 1460-1465, (November 1991).
3. C.A. Mandal, P.P. Chakrabarti and S. Ghose, Port assignment for dual and triple port memories using a genetic approach, In Proceedings of The Third Asia Pacific Conference on Hardware Description Languages (APCHDL) 96, pp. 60-64, (1996).
4. th Design Automation Conference, (1987).
5. E. Horowitz and S. Sahni, Computer Algorithms, Galgotia Press, New Delhi, India, (1988).
6. T.C. Wilson, D.K. Banerjee, A. Basu, J.C. Majithia and A.K. Majumdar, Port assignment in multiport memories for interconnection minimization in data path synthesis, In Proceedings of IFIP Working Conference on Logic and Architecture Synthesis, Paris, (May 1990).
7. A.V. Aho, R. Sethi and J.D. Ullman, COMPILERS Principles, Techniques and Tools, Addison-Wesley, (June 1987).
8. M.W. Krentel, The complexity of optimization problems, Journal of Computer and System Sciences 36, 490-509, (1988).
9. th South Eastern Conference on Combinatorics, Graph Theory & Computing, (1974).
10. th Annual ACM Symposium of the Theory of Computing, (1993).
11. A.A. Duncan and D.C. Hendry, Area efficient dsp synthesis, In Proceedings of the 1995 European Design Automation Conference, pp. 130-135, (September 1995).
12. C.A. Mandal, P.P. Chakrabarti and S. Ghose, Allocation and binding for data path synthesis using a genetic approach, In Proceedings of VLSI Design '96, pp. 95-99, (1996).