A Low Complexity Scaling Method for the Lanczos Kernel in Fixed-Point Arithmetic

Provided by: Institute of Electrical & Electronic Engineers
Topic: Hardware
Format: PDF
The authors consider the problem of enabling fixed-point implementation of linear algebra kernels on low cost embedded systems, as well as motivating more efficient computational architectures for scientific applications. Fixed-point arithmetic presents additional design challenges compared to floating-point arithmetic, such as having to bound peak values of variables and control their dynamic ranges. Algorithms for solving linear equations or finding eigen-values are typically non-linear and iterative, making solving these design challenges a non-trivial task. For these types of algorithms the bounding problem cannot be automated by current tools.

Find By Topic