Journal of Algorithms

Paper

01 Jan 1983

Minimal algorithms for bilinear forms may have divisions

View publication

Abstract

We present a minimal algorithm for computing a set of bilinear forms which uses divisions. © 1983.

Related

Paper

Scaled DCT's on Input Sizes that Are Composite

Ephraim Feig, Elliot Linzer

IEEE TSP

Paper

A block-based gradient descent search algorithm for block motion estimation in video coding

Lurng-Kuo Liu, Ephraim Feig

IEEE TCSVT

Paper

Hadamard Transforms on Multiply/Add Architectures

Don Coppersmith, Ephraim Feig, et al.

IEEE TSP

Paper

Implementation of Efficient Fft Algorithms on Fused Multiply-Add Architectures

Elliot N. Linzer, Ephraim Feig

IEEE TSP

View all publications