Algorithm and VLSI architecture of a parallel arithmetic entropy coder for parallel H.264 video encoders

Author(s):  
Shenggang Chen ◽  
Shuming Chen ◽  
Yao Liu ◽  
Huitao Gu
2004 ◽  
Vol 13 (06) ◽  
pp. 1347-1378 ◽  
Author(s):  
YI-QIANG HU ◽  
BING-FEI WU ◽  
CHORNG-YANN SU

This manuscript presents a VLSI architecture and its design rule, called embedded instruction code (EIC), to realize discrete wavelet transform (DWT) codec in a single chip. Since the essential computation of DWT is convolution, we build a set of multiplication instruction, MUL, and the addition instruction, ADD, to complete the work. We segment the computation paths of DWT according to the multiplication and addition, and apply the instruction codes to execute the operators. Besides, we offer a parallel arithmetic logic unit (PALU) organization that is composed of two multipliers and four adders (2M4A) in our design. Thus, the instruction codes programmed by EIC control the PALU to compute efficiently. Additionally, we establish a few necessary registers in PALU, and the number of registers depends on the wavelet filters' length and the decomposition level. Yet, the numbers of multipliers and adders do not increase as we execute the DWT or the inverse DWT (IDWT) in multilevel decomposition. Furthermore, we deduce the similarity between DWT and IDWT, so the functions can be integrated in the same architecture. Besides, we schedule the instructions; thus, the execution of the multilevel processes can be achieved without superfluous PALU in a single chip. Moreover, we solve the boundary problem of DWT by using the symmetric extension. Therefore, the perfect reconstruction (PR) condition for DWT requirement can be accomplished. Through EIC, we can systematically generate a flexible instruction codes while we adopt different filters. Our chip supports up to six levels of decomposition, and versatile image specifications, e.g., VGA, MPEG-1, MPEG-2, and 1024×1024 image sizes. The processing speed is 7.78 Mpixel/s when the operation frequency, for normal case, is 100 MHz.


2013 ◽  
Vol 10 (9) ◽  
pp. 20130210-20130210 ◽  
Author(s):  
Hong Liang ◽  
He Weifeng ◽  
Zhu Hui ◽  
Mao Zhigang
Keyword(s):  

2011 ◽  
Vol 250-253 ◽  
pp. 4061-4064
Author(s):  
Chun Ling Zhang

The existence of maximum point, oddity point and saddle point often leads to computation failure. The optimization idea is based on the reality that the optimum towards the local minimum related the initial point. After getting several optimal results with different initial point, the best result is taken as the final optimal result. The arithmetic improvement of multi-dimension Newton method is improved. The improvement is important for the optimization method with grads convergence rule or searching direction constructed by grads. A computational example with a saddle point, maximum point and oddity point is studied by multi-dimension Newton method, damped Newton method and Newton direction method. The importance of the idea of blind walking repeatedly is testified. Owing to the parallel arithmetic of modernistic optimization method, it does not need to study optimization problem with seriate feasible domain by modernistic optimization method.


Author(s):  
Patricia U. L. da Costa ◽  
Guilherme Paim ◽  
Leandro Rocha ◽  
Eduardo da Costa ◽  
Sergio Almeida ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document