An approximate computing technique for reducing the complexity of a direct-solver for sparse linear systems in real-time video processing

Many video processing algorithms are formulated as least-squares problems that result in large, sparse linear systems. Solving such systems in real time is very demanding. This paper focuses on reducing the computational complexity of a direct Cholesky-decomposition-based solver. Our approximation s...

Full description

Bibliographic Details

Published in:	Proceedings - ACM IEEE Design Automation Conference pp. 1 - 6
Main Authors:	Schaffner, Michael, Gurkaynak, Frank K., Smolic, Aljosa, Kaeslin, Hubert, Benini, Luca
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.06.2014
Subjects:	Accuracy Approximate Computing Cholesky Decomposition Computational complexity Equations Hardware Hardware Accelerator Linear systems Matrix decomposition Streaming media Video Processing
ISSN:	0738-100X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!