Sensing Matrix Optimization for Block-Sparse Decoding
نویسندگان
چکیده
منابع مشابه
Block-length dependent thresholds for l2/l1-optimization in block-sparse compressed sensing
One of the most basic problems in compressed sensing is solving an under-determined system of linear equations. Although this problem seems rather hard certain 1-optimization algorithm appears to be very successful in solving it. The recent work of [3, 6] rigorously proved (in a large dimensional and statistical context) that if the number of equations (measurements in the compressed sensing te...
متن کاملSparse Matrix Block-Cyclic Redistribution
Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterization of the sparse matrix redistribution and its associate problematic due to the use of compressed representations. Two main improvements about the buffering and the coordinates calculation modify the original algorithm...
متن کاملBlock Algorithms for Sparse Matrix by Dense Matrix Multiplication
Sparse matrix computations appear in many linear algebra kernels of scienti c applications. The study, evaluation and optimization of sparse matrix codes is more complex than the dense case. Moreover, the irregularity of some memory accesses and the a-priory lack of knowledge of the number of iterations to be perfomed in some loops (both depending on the sparsity pettern) limit the succes of pr...
متن کاملComdined Turbo Block Decoding and Equalisation
In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...
متن کاملSparsity: Optimization Framework for Sparse Matrix Kernels
Sparse matrix-vector multiplication is an important computational kernel that performs poorly on most modern processors due to a low compute-to-memory ratio and irregular memory access patterns. Optimization is difficult because of the complexity of cache-based memory systems and because performance is highly dependent on the nonzero structure of the matrix. The Sparsity system is designed to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2011
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2011.2159211