Advertisement
Published in:
2016 | OriginalPaper | Chapter
Efficient Implementation of Givens QR Decomposition on VLIW DSP Architecture for Orthogonal Matching Pursuit Image Reconstruction
Authors : Mohamed Najoui, Anas Hatim, Mounir Bahtat, Said Belkouch
Published in: Proceedings of the Mediterranean Conference on Information & Communication Technologies 2015
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Orthogonal Matching Pursuit (OMP) is one of the most used image reconstruction algorithm in compressed sensing technique (CS). This algorithm can be divided into two main stages: optimization problem and least square problem (LSP). The most complex and time consuming step of OMP is the LSP resolution. QR decomposition is one of the most used techniques to solve the LSP in a reduced processing time. In this paper, an efficient and optimized implementation of QR decomposition on TMS320C6678 floating point DSP is introduced. A parallel Givens algorithm is designed to make better use of the 2-way set associative cache. A special data arrangement was adopted to avoid cache misses and allow the use of some intrinsic functions. Our implementation reduces significantly the processing time; it is 6.7 times faster than the state of the art implementations. We have achieved a 1-core performance of 1.51 GFLOPS with speedups of up to x20 compared to Standard Givens Rotations (GR) algorithm.