Fetching the paper…
Reading the bibliography…
In this paper we address a series of open questions about the construction of spatially coupled measurement matrices in compressed sensing.
A. Jimenez Felstrom and K. Zigangirov, “Time-varying periodic convolutional codes with low-density parity-check matrix,” IEEE Transactions on Information Theory , vol. 45, no. 6, pp. 2181 –2191, 1999
1999
Earlier work this paper cites.
M. Lentmaier, A. Sridharan, K. S. Zigangirov, and D. Costello, “Terminated ldpc convolutional codes with thresholds close to capacity,” in Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on . IEEE, 2005, pp. 1372–1376
2005
Earlier work this paper cites.
D. L. Donoho and J. Tanner, “Sparse nonnegative solution of underdetermined linear equations by linear programming,” Proceedings of the National Academy of Sciences of the United States of America , vol. 102, no. 27, pp. 9446–9451, 2005
2005
Earlier work this paper cites.
D. L. Donoho, “Compressed sensing,” IEEE Trans. Inform. Theory , vol. 52, p. 1289, 2006
2006
Earlier work this paper cites.
E. J. Candès and M. B. Wakin, “An introduction to compressive sampling,” IEEE Signal Processing Magazine , vol. 25, no. 2, pp. 21–30, Mar. 2008
2008
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Natl. Acad. Sci. , vol. 106, no. 45, pp. 18 914–18 919, 2009
2009
Earlier work this paper cites.
M. Lentmaier, A. Sridharan, D. J. Costello, and K. S. Zigangirov, “Iterative decoding threshold analysis for ldpc convolutional codes,” IEEE Transactions on Information Theory , vol. 56, no. 10, pp. 5274–5289, 2010
2010
Earlier work this paper cites.
S. Kudekar and H. Pfister, “The effect of spatial coupling on compressive sensing,” in Communication, Control, and Computing (Allerton) , 2010, pp. 347–353
2010
Cited alongside, same era.
S. Kudekar, T. J. Richardson, and R. L. Urbanke, “Threshold saturation via spatial coupling: Why convolutional ldpc ensembles perform so well over the bec,” IEEE Transactions on Information Theory , vol. 57, no. 2, pp. 803–834, 2011
2011
Cited alongside, same era.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in IEEE International Symposium on Information Theory Proceedings (ISIT) , 2011, pp. 2168 –2172
2011
Cited alongside, same era.
S. Kudekar, T. Richardson, and R. Urbanke, “Spatially coupled ensembles universally achieve capacity under belief propagation,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on . IEEE, 2012, pp. 453–457
2012
Cited alongside, same era.
D. L. Donoho, A. Javanmard, and A. Montanari, “Information-theoretically optimal compressed sensing via spatial coupling and approximate message passing,” in Proc. of the IEEE Int. Symposium on Information Theory (ISIT) , 2012
2012
Later among the works it cites.
A. Yedla, Y.-Y. Jian, P. S. Nguyen, and H. D. Pfister, “A simple proof of threshold saturation for coupled scalar recursions,” in 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) . IEEE, 2012, pp. 51–55
2012
Later among the works it cites.
2012
Later among the works it cites.
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, “Statistical physics-based reconstruction in compressed sensing,” Phys. Rev. X , vol. 2, p. 021005, 2012
2012
Cited alongside, same era.
F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, “Probabilistic reconstruction in compressed sensing: Algorithms, phase diagrams, and threshold achieving matrices,” J. Stat. Mech. , p. P08009, 2012
2012
Cited alongside, same era.
S. H. Hassani, N. Macris, and R. Urbanke, “Chains of mean-field models,” Journal of Statistical Mechanics: Theory and Experiment , vol. 2012, no. 02, p. P02011, 2012
2012
Later among the works it cites.