Algebraic techniques in the memory size computation of multimedia processing applications

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 memories. Hence, the optimization of the memory architecture is a crucial step in the design methodology for this type of applications. In deriving an optimized memory architecture, memory size computation is an important step in the data transfer and storage exploration stage. This work investigates non-scalar methods for computing the memory size in real-time multimedia algorithms. The approach is based on more recent algebraic techniques specific to the data-flow analysis used in modem compilers. In contrast with previous works which utilize only approximate methods due to the size of the problems (in terms of number of scalars) and single-assignment specifications, this research aims to obtain exact determinations even for large applications.