Abstract | ||
---|---|---|
In the recent past, various methods have been proposed to construct deterministic compressed sensing (CS) matrices. Of interest has been the construction of binary sensing matrices as they are useful for multiplierless and faster dimensionality reduction. In most of these binary constructions, the matrix size depends on primes or their powers. In this study, we propose a composition rule which exp... |
Year | DOI | Venue |
---|---|---|
2016 | 10.1109/LSP.2016.2585181 | IEEE Signal Processing Letters |
Keywords | Field | DocType |
Sensors,Coherence,Compressed sensing,Sparse matrices,Matching pursuit algorithms,Electronic mail,Indexes | Mathematical optimization,Kronecker product,Matrix (mathematics),Matrix multiplication,Sparse matrix,Restricted isometry property,Compressed sensing,Mathematics,Random matrix,Binary number | Journal |
Volume | Issue | ISSN |
23 | 8 | 1070-9908 |
Citations | PageRank | References |
4 | 0.45 | 16 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Pradip Sasmal | 1 | 4 | 2.48 |
R. Ramu Naidu | 2 | 24 | 2.66 |
Challa S. Sastry | 3 | 65 | 9.51 |
Phanindra Jampana | 4 | 6 | 1.21 |