Approximate On-chip Memory Optimization Method For Deep Residual Networks

Author(s):  
Xuedi Wang ◽  
Zhe Chen ◽  
Kaige Jia ◽  
Jie Han ◽  
Qi Wei ◽  
...  
2011 ◽  
Vol 179-180 ◽  
pp. 1350-1355
Author(s):  
Duo Li Zhang ◽  
Chuan Jie Wang ◽  
Yu Kun Song ◽  
Gao Ming Du ◽  
Xian Wen Cheng

H.264/AVC standard has been widely used in video compression at various kinds of application domain. Motion estimation takes the most calculation workload of H.264/AVC encoder. Memory optimization has played an even more important role in encoder design. Firstly, dependency relation between motion vectors was analyzed and removed at a little cost of estimation accuracy decrement, and then a 3-stage macro-block level pipeline architecture was proposed to increase parallel process ability of motion estimation. Then an optimized memory organization strategy of reference frame data was put forward, aiming at avoiding row changing frequently in SDRAM access. Finally, based on the 3-stage pipeline structure, a shared cyclic search window memory was proposed: 1) data relativity between adjacent macro-block was analyzed, 2) and search window memory size was elaborated, 3) and then a slice based structure and the work process were discussed. Analysis and experiment result show that 50% of on chip memory resource and cycles for off chip SDRAM access can be saved. The whole design was implemented with Verilog HDL and integrated into a H.264 encoder, which can demo 1280*720@30 video successfully at frequency of 120MHz under a cyclone III FPGA development board.


Electronics ◽  
2019 ◽  
Vol 8 (12) ◽  
pp. 1507
Author(s):  
Gaoming Du ◽  
Chao Tian ◽  
Zhenmin Li ◽  
Duoli Zhang ◽  
Chuan Zhang ◽  
...  

The delay bound in system on chips (SoC) represents the worst-case traverse time of on-chip communication. In network on chip (NoC)-based SoC, optimizing the delay bound is challenging due to two aspects: (1) the delay bound is hard to obtain by traditional methods such as simulation; (2) the delay bound changes with the different application mappings. In this paper, we propose a delay bound optimization method using discrete firefly optimization algorithms (DBFA). First, we present a formal analytical delay bound model based on network calculus for both unipath and multipath routing in NoCs. We then set every flow in the application as the target flow and calculate the delay bound using the proposed model. Finally, we adopt firefly algorithm (FA) as the optimization method for minimizing the delay bound. We used industry patterns (video object plane decoder (VOPD), multiwindow display (MWD), etc.) to verify the effectiveness of delay bound optimization method. Experiments show that the proposed method is both effective and reliable, with a maximum optimization of 42.86%.


Author(s):  
Wei Hu ◽  
Binbin Wu ◽  
Bin Xie ◽  
Tianzhou Chen ◽  
Lianghua Miao

Author(s):  
Maximilian Odendahl ◽  
Andres Goens ◽  
Rainer Leupers ◽  
Gerd Ascheid ◽  
Tomas Henriksson

2008 ◽  
Vol 57 (2) ◽  
pp. 263-283 ◽  
Author(s):  
B. Girodias ◽  
Y. Bouchebaba ◽  
G. Nicolescu ◽  
E. M. Aboulhamid ◽  
P. Paulin ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document