الفهرس 
Chapter 1 IntroductionOnly 14 pages are availabe for public view
 |  | from | 105 |  |  |
| | | from | 105 | | |
Abstract
The proposed FBHT algorithm for the sparse signal reconstruction in compressed sensing system,
has been proposed. It is an iterative algorithm with two stages which are the forward and the
backward. The forward stage expands the support by the forward step size a >1, and the backward
stage removes the backward step size P < a . Increasing a decreasing P represent the most
important conditions for achieving near perfect reconstruction. After the simulation programs
execution, the choice of a =30 and p =a -1 have been the best values for the FBHT algorithm. One
of the most important property of the FBHT has been its independency on the sparsity level which is
considered as an advance of our proposed algorithms compared to related ones. Furthermore, the
FBHT algorithm has investigated better performance than previous algorithms in terms of the signal
to error ratio and the mean square error. Moreover, the impact of the sparsity level has been
discussed.