Buffer memory optimization for video codec application modeled in Simulink

  • Authors:
  • Sang-Il Han;Xavier Guerin;Soo-Ik Chae;Ahmed A. Jerraya

  • Affiliations:
  • Seoul National Univ., Seoul, Korea and SLS Group, Grenoble, France;SLS Group, Grenoble, France;Seoul National Univ., Seoul, Korea;SLS Group, Grenoble, France

  • Venue:
  • Proceedings of the 43rd annual Design Automation Conference
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Reduction of the on-chip memory size is a key issue in video codec system design. Because video codec applications involve complex algorithms that are both data-intensive and control-dependent, memory optimization based on global and precise analysis of data and control dependency is required. We generate a memory-efficient C code from a restricted Simulink model, which can represent both data and control dependency explicitly, by applying two buffer memory optimization techniques: copy removal and buffer sharing. Copy removal is performed while parsing the Simulink model. Buffer sharing requires global scheduling and formal lifetime analysis. Experimental results on an H.264 video decoder show that the buffer memory size and execution time of the C code generated by the proposed method are 71% and 32% less than those of the C code produced by Simulink's C code generator, respectively. When compared to the hand written C code, the memory size was reduced by 27% while its execution time was increased by only 3%.