Memory size computation for multimedia processing applications

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 2006, Issue , 2006, Pages 802-807

  Zhu, Hongwei ^a   Luican, Ilie I ^a   Balasa, Florin ^a  

^a 1120 Science and Engineering Offices   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; DATA FLOW ANALYSIS; DATA HANDLING; DATA STORAGE EQUIPMENT; DATA TRANSFER; PROGRAM COMPILERS; REAL TIME SYSTEMS;

DATA STORAGE; MEMORY SIZE; POWER CONSUMPTION; REAL-TIME MULTIMEDIA ALGORITHMS;

MULTIMEDIA SYSTEMS;

EID: 33748629901     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1118299.1118483     Document Type: Conference Paper

References (17)

1. D. Avis, "lrs: A revised implementation of the reverse search vertex enumeration algorithm," in Polytopes - Combinatorics and Compu tation, G. Kalai, G. Ziegler, Birkhauser-Verlag, pp. 177-198, 2000.
2. F. Balasa, F. Catthoor, H. De Man, "Background memory area estimation for multi-dimensional signal processing systems," IEEE Trans. VLSI Syst., vol. 3, no. 2, pp. 157-172, June 1995.
3. A.I. Barvinok, "A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed," Mathematics of Operations Research, vol. 19, no. 4, pp. 769-779, Nov. 1994.
4. F. Catthoor, S. Wuytack, E. De Greef, F. Balasa, L. Nachtergaele, A. Vandecappelle, Custom Memory Management Methodology: Exploration of Memory Organization for Embedded Multimedia System Design, Kluwer Academic Publishers, Boston, 1998.
5. G.B. Dantzig, B.C. Eaves, "Fourier-Motzkin elimination and its dual," J. Combinatorial Theory (A), vol. 14, pp. 288-297, 1973.
6. J.A. De Loera, R. Hemmecke, J. Tauzer, R. Yoshida, "Effective lattice point counting in rational convex polytopes," http:/www.math. ucdavis.edu/~latte/pdf/lattE.pdf,2003.
7. P.O. Kjeldsberg, F. Catthoor, E.J. Aas, "Data dependency size estimation for use in memory optimization," IEEE Trans. CAD of IC's and Syst., vol. 22, no. 7, pp. 908-921, July 2003.
8. F.J. Kurdahi, A.C. Parker, "REAL: A program for register allocation," Proc. 24th Design Automation Conf., pp. 210-215, 1987.
9. S.S. Muchnick, Advanced Compiler Design and Implementation, Morgan Kaufmann, San Francisco, 1997.
10. P.R. Panda, F. Catthoor, N. Dutt, K. Dankaert, E. Brockmeyer, C. Kulkarni, P.O. Kjeldsberg, "Data and memory optimization techniques for embedded systems," ACM Trans. Design Automation of Electronic Syst., vol. 6, no. 2, pp. 149-206, April 2001.
11. K.K. Parhi, "Calculation of minimum number of registers in arbitrary life time chart," IEEE Trans. Circ. & Syst. - II: Analog and Digital Signal Processing, vol. 41, no. 6, pp. 434-436, 1994.
12. W. Pugh, "A practical algorithm for exact array dependence analysis," Comm. of the ACM, vol. 35, no. 8, pp. 102-114, Aug. 1992.
13. A. Schrijver, Theory of Linear and Integer Programming, John Wiley, New York, 1986.
14. L. Stok, J. Jess, "Foreground memory management in data path synthesis", Int. J. Circuit Theory and Appl., vol. 20, pp. 235-255, 1992.
15. L. Thiele, "Compiler techniques for massive parallel architectures," in State-of-the-art in Computer Science, P. Dewilde (ed.), Kluwer Acad. Publ., 1992.
16. I. Verbauwhede, C. Scheers, J.M. Rabaey, "Memory estimation for high level synthesis," Proc. 31st ACM/IEEE Design Automation Conf., pp. 143-148, June 1994.
17. Y. Zhao, S. Malik, "Exact memory size estimation for array computations," IEEE Trans. VLSI Syst., vol. 8, no. 5, pp. 517-521, 2000.