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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings - ACM IEEE Design Automation Conference s. 1 - 6
Hlavní autori:	Schaffner, Michael, Gurkaynak, Frank K., Smolic, Aljosa, Kaeslin, Hubert, Benini, Luca
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2014
Predmet:	Accuracy Approximate Computing Cholesky Decomposition Computational complexity Equations Hardware Hardware Accelerator Linear systems Matrix decomposition Streaming media Video Processing
ISSN:	0738-100X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!