Maximally fast and arbitrarily fast implementation of linear computations (circuit layout CAD)

Abstract

It is pointed out that by establishing a relationship between the basic properties of linear computations and several optimizing transformations, it is possible to optimally speed up linear computations with respect to those transformations while keeping the latency fixed. Furthermore, arbitrarily fast, asymptotically optimal implementations can be obtained by adding retiming and loop unrolling to the transformations set and trading latency for throughput. The proposed techniques have yielded results superior to the best published previously on all benchmark examples. The presented approach is also applicable to general (nonlinear) computations.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>