In this paper, we propose a fast algorithm that can reduce the complexity for inter mode decision of the H.264 encoder by minimizing a large amount of calculation of inter mode decision process adaptively. We focus mainly on extracting the large block size mode, which is 16x16 mode, efficiently. From examination of various sequences, we know that the percentage of large block size mode which se...

A merging procedure for variable-size block motion estimation is proposed to reduce the computation for block-size decision. A smaller block-size is initially used for motion estimation. An adaptive threshold, which depends on the information obtained from the motion estimation, quantization parameter, and rate distortion cost function is used to determine if the motion vectors of the neighbori...

The H.264/AVC standard achieves significantly high coding efficiency if multiple block size Motion Estimation is adopted. However, the complexity of Motion Estimation and DCT is dramatically increased as a result. In previous work we propose an early mode decision algorithm to control the complexity, based on all-zero-blocks detection in 16×16 size. In this paper, we improve the algorithm. Firs...

Hardware architecture of Rate-Distortion Optimization (RDO) is proposed, which is dedicated to H.264 block size decision of 1080 HD. To achieve high encoding efficiency of H.264, RDO for block size decision is indispensable but suffers from enormous computational costs since distortion and the number of coded bits can be determined only after completing the whole encoding processes of the block...

The implicit block methods based on the backward differentiation formulae (BDF) for the solution of stiff initial value problems (IVPs) using variable step size is derived. We construct a variable step size block methods which will store all the coefficients of the method with a simplified strategy in controlling the step size with the intention of optimizing the performance in terms of precisi...

For prime power q, we determine the minimum number of parallel classes in a resolvable 2-(kq, L 1) covering for almost all values of k. @ 1999 Elsevier Science B.V. All rights reserved In September 1995 Jan van Haastrecht gave a dinner on the occasion of his retirement. He had invited 20 colleagues. The host and the guests were to be seated at three tables each of which had seven places. The di...

Abstract Two GI/M/1 type Markov chains associated with the queue length are often used in analyzing the discrete time MAP/PH/K queue. The first Markov chain is introduced by tracking service phases for servers; a method we call TPFS. The transition probability matrix of the Markov chain can be constructed in a straightforward manner. The second Markov chain is introduced by counting servers for...

This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons). We present new polygonal designs with various parameter sets by explicit construction. In doing so we employ several construction methods – some conventional and some new. We also establish a link between a class of ...