Abstract: A computational complexity scalable algorithm(CSS) is presented for block matching motion estimation in video encoding. The CSS shares the feature of fast convergence in TSS and the advantage of center bias searching in FSS and DS, and with the uniform shape of searching pattern in algorithm, the VLSI implementation of the CSS becomes easier than that of other fast motion estimation algorithms like DS. The scalability of computation payloads has been achieved based on searching steps adjusted and block pixel sub-sampled. The proposed algorithm and architecture are suitable for the low power implementation of video encoding that needs flexible scalable capability.

Key words: block matching motion estimation, computational complexity scalable, low power