IEICE TRANSACTIONS on Fundamentals
Memory Size Computation for Real-Time Multimedia Applications Based on Polyhedral Decomposition
Summary :
In real-time multimedia processing systems a very large part of the power consumption is due to the data storage and data transfer. Moreover, the area cost is often largely dominated by the memory modules. In deriving an optimized (for area and/or power) memory architecture, memory size computation is an important step in the exploration of the possible algorithmic specifications of multimedia applications. This paper presents a novel non-scalar approach for computing exactly the memory size in real-time multimedia algorithms. This methodology uses both algebraic techniques specific to the data-flow analysis used in modern compilers and, also, more recent advances in the theory of polyhedra. In contrast with all the previous works which are only estimation methods, this approach performs exact memory computations even for applications significantly large in terms of the code size, number of scalars, and number of array references.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.12 pp.3378-3386
- Publication Date
- 2006/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e89-a.12.3378
- Type of Manuscript
- Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
- Category
- System Level Design
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hongwei ZHU, Ilie I. LUICAN, Florin BALASA, "Memory Size Computation for Real-Time Multimedia Applications Based on Polyhedral Decomposition" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 12, pp. 3378-3386, December 2006, doi: 10.1093/ietfec/e89-a.12.3378.
Abstract: In real-time multimedia processing systems a very large part of the power consumption is due to the data storage and data transfer. Moreover, the area cost is often largely dominated by the memory modules. In deriving an optimized (for area and/or power) memory architecture, memory size computation is an important step in the exploration of the possible algorithmic specifications of multimedia applications. This paper presents a novel non-scalar approach for computing exactly the memory size in real-time multimedia algorithms. This methodology uses both algebraic techniques specific to the data-flow analysis used in modern compilers and, also, more recent advances in the theory of polyhedra. In contrast with all the previous works which are only estimation methods, this approach performs exact memory computations even for applications significantly large in terms of the code size, number of scalars, and number of array references.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.12.3378/_p
Copy
@ARTICLE{e89-a_12_3378,
author={Hongwei ZHU, Ilie I. LUICAN, Florin BALASA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Memory Size Computation for Real-Time Multimedia Applications Based on Polyhedral Decomposition},
year={2006},
volume={E89-A},
number={12},
pages={3378-3386},
abstract={In real-time multimedia processing systems a very large part of the power consumption is due to the data storage and data transfer. Moreover, the area cost is often largely dominated by the memory modules. In deriving an optimized (for area and/or power) memory architecture, memory size computation is an important step in the exploration of the possible algorithmic specifications of multimedia applications. This paper presents a novel non-scalar approach for computing exactly the memory size in real-time multimedia algorithms. This methodology uses both algebraic techniques specific to the data-flow analysis used in modern compilers and, also, more recent advances in the theory of polyhedra. In contrast with all the previous works which are only estimation methods, this approach performs exact memory computations even for applications significantly large in terms of the code size, number of scalars, and number of array references.},
keywords={},
doi={10.1093/ietfec/e89-a.12.3378},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Memory Size Computation for Real-Time Multimedia Applications Based on Polyhedral Decomposition
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3378
EP - 3386
AU - Hongwei ZHU
AU - Ilie I. LUICAN
AU - Florin BALASA
PY - 2006
DO - 10.1093/ietfec/e89-a.12.3378
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2006
AB - In real-time multimedia processing systems a very large part of the power consumption is due to the data storage and data transfer. Moreover, the area cost is often largely dominated by the memory modules. In deriving an optimized (for area and/or power) memory architecture, memory size computation is an important step in the exploration of the possible algorithmic specifications of multimedia applications. This paper presents a novel non-scalar approach for computing exactly the memory size in real-time multimedia algorithms. This methodology uses both algebraic techniques specific to the data-flow analysis used in modern compilers and, also, more recent advances in the theory of polyhedra. In contrast with all the previous works which are only estimation methods, this approach performs exact memory computations even for applications significantly large in terms of the code size, number of scalars, and number of array references.
ER -
English
