Elliot Neil Linzer

Hadamard transforms on multiply/add architectures

A new algorithm for computing Hadamard transforms is presented. If n is a power of four, then the new algorithm uses 7/8 n log/sub 2/ n multiply/adds to compute a Hadamard transform of length n. >

High performance algorithms for MPEG motion estimation

We propose two high performance algorithms for motion estimation searching. The first algorithm express minimum mean square error motion estimation in terms of a cross-correlation computation; this approach reduces the number of multiply-adds needed by almost factor of two, with further improvement possible when fast cross-correlation algorithms are used. In the second algorithm we express the motion estimation computation in a form similar to the matrix-matrix multiplication computation. We propose an efficient algorithm for this computation. The algorithm exploits the memory hierarchy of the target processor and gives optimal performance for this formulation. In certain cases, both approaches can be used simultaneously.