Fetching the paper…
Reading the bibliography…
Estimation of a vector from quantized linear measurements is a common problem for which simple linear techniques are suboptimal -- sometimes greatly so.
A. D. Wyner and J. Ziv, “The rate-distortion function for source coding with side information at the decoder,” IEEE Trans. Inform. Theory , vol. IT-22
1976
Earlier work this paper cites.
A. Gersho, “Principles of quantization,” IEEE Trans. Circuits Syst. , vol. CAS-25, no. 7, pp. 427–436, Jul. 1978
1978
Earlier work this paper cites.
J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference . San Mateo, CA: Morgan Kaufmann Publ., 1988
1988
Earlier work this paper cites.
V. A. Vaishampayan, “Design of multiple description scalar quantizers,” IEEE Trans. Inform. Theory , vol. 39, no. 3, pp. 821–834, May 1993
1993
Earlier work this paper cites.
N. T. Thao and M. Vetterli, “Reduction of the MSE in R R -times oversampled A/D conversion from O ( 1 / R ) O(1/R) to O ( 1 / R 2 ) O(1/R^{2}) ,” IEEE Trans. Signal Process. , vol. 42, no. 1, pp. 200–203, Jan. 1994
1994
Earlier work this paper cites.
——, “Deterministic analysis of oversampled A/D conversion and decoding improvement based on consistent estimates,” IEEE Trans. Signal Process. , vol. 42, no. 3, pp. 519–531, Mar. 1994
1994
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. Royal Stat. Soc., Ser. B , vol. 58, no. 1, pp. 267–288, 1996
1996
Earlier work this paper cites.
N. T. Thao and M. Vetterli, “Lower bound on the mean-squared error in oversampled quantization of periodic signals using vector quantization analysis,” IEEE Trans. Inform. Theory , vol. 42, no. 2, pp. 469–479, Mar. 1996
1996
Earlier work this paper cites.
V. K. Goyal, M. Vetterli, and N. T. Thao, “Quantized overcomplete expansions in ℝ N {\mathbb{R}}^{N} : Analysis, synthesis, and algorithms,” IEEE Trans. Inform. Theory , vol. 44, no. 1, pp. 16–31, Jan. 1998
1998
Earlier work this paper cites.
R. M. Gray and D. L. Neuhoff, “Quantization,” IEEE Trans. Inform. Theory , vol. 44, no. 6, pp. 2325–2383, Oct. 1998
1998
Earlier work this paper cites.
Z. Cvetković and M. Vetterli, “Error-rate characteristics of oversampled analog-to-digital conversion,” IEEE Trans. Inform. Theory , vol. 44, no. 5, pp. 1961–1964, Sep. 1998
1998
Earlier work this paper cites.
R. H. Walden, “Analog-to-digital converter survey and analysis,” IEEE J. Sel. Areas Comm. , vol. 17, no. 4, pp. 539–550, Apr. 1999
1999
Earlier work this paper cites.
V. K. Goyal, “Theoretical foundations of transform coding,” IEEE Signal Process. Mag. , vol. 18, no. 5, pp. 9–21, Sep. 2001
2001
Earlier work this paper cites.
S. Rangan and V. K. Goyal, “Recursive consistent estimation with bounded noise,” IEEE Trans. Inform. Theory , vol. 47, no. 1, pp. 457–464, Jan. 2001
2001
Earlier work this paper cites.
V. K. Goyal, “Multiple description coding: Compression meets the network,” IEEE Signal Process. Mag. , vol. 18, no. 5, pp. 74–93, Sep. 2001
2001
Earlier work this paper cites.
T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity check codes under message-passing decoding,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 599–618, Feb. 2001
2001
Earlier work this paper cites.
V. K. Goyal, J. Kovačević, and J. A. Kelner, “Quantized frame expansions with erasures,” Appl. Comput. Harm. Anal. , vol. 10, no. 3, pp. 203–233, May 2001
2001
Earlier work this paper cites.
H. Viswanathan and R. Zamir, “On the whiteness of high-resolution quantization errors,” IEEE Trans. Inform. Theory , vol. 47, no. 5, pp. 2029–2038, Jul. 2001
2001
Cited alongside, same era.
J. Boutros and G. Caire, “Iterative multiuser joint decoding: Unified framework and asymptotic analysis,” IEEE Trans. Inform. Theory , vol. 48, no. 7, pp. 1772–1793, Jul. 2002
2002
Cited alongside, same era.
Z. Cvetković, “Resilience properties of redundant expansions under additive noise and quantization,” IEEE Trans. Inform. Theory , vol. 49, no. 3, pp. 644–656, Mar. 2003
2003
Cited alongside, same era.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Understanding belief propagation and its generalizations,” in Exploring Artificial Intelligence in the New Millennium . San Francisco, CA: Morgan Kaufmann Publishers, 2003, pp. 239–269
2003
Cited alongside, same era.
B. G. Bodmann and S. P. Lipshitz, “Randomly dithered quantization and sigma–delta noise shaping for finite frames,” Appl. Comput. Harm. Anal. , vol. 25, no. 3, pp. 367–380, Nov. 2008
2008
Later among the works it cites.
E. J. Candès and M. B. Wakin, “An introduction to compressive sampling,” IEEE Signal Process. Mag. , vol. 25, no. 2, pp. 21–30, Mar. 2008
2008
Later among the works it cites.
V. K. Goyal, A. K. Fletcher, and S. Rangan, “Compressive sampling and lossy compression,” IEEE Signal Process. Mag. , vol. 25, no. 2, pp. 48–56, Mar. 2008
2008
Later among the works it cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Nat. Acad. Sci. , vol. 106, no. 45, pp. 18 914–18 919, Nov. 2009
2009
Later among the works it cites.
J. Z. Sun and V. K. Goyal, “Optimal quantization of random measurements in compressed sensing,” in Proc. IEEE Int. Symp. Inform. Theory , Seoul, Korea, Jun.–Jul. 2009, pp. 6–10
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Tanaka and M. Okada, “Approximate belief propagation, density evolution, and neurodynamics for CDMA multiuser detection,” IEEE Trans. Inform. Theory , vol. 51, no. 2, pp. 700–706, Feb. 2005
2005
Cited alongside, same era.
J. J. Benedetto, A. M. Powell, and Ö. Yilmaz, “Sigma–Delta ( Σ Δ \Sigma\Delta ) quantization and finite frames,” IEEE Trans. Inform. Theory , vol. 52, no. 5, pp. 1990–2005, May 2006
2006
Cited alongside, same era.
D. Guo and C.-C. Wang, “Asymptotic mean-square optimality of belief propagation for sparse linear systems,” in Proc. IEEE Inform. Theory Workshop , Chengdu, China, Oct. 2006, pp. 194–198
2006
Cited alongside, same era.
Z. Liu, S. Cheng, A. D. Liveris, and Z. Xiong, “Slepian–Wolf coded nested lattice quantization for Wyner–Ziv coding: High-rate performance analysis and code design,” IEEE Trans. Inform. Theory , vol. 52, no. 10, pp. 4358–4379, Oct. 2006
2006
Cited alongside, same era.
E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inform. Theory , vol. 52, no. 2, pp. 489–509, Feb. 2006
2006
Cited alongside, same era.
E. J. Candès and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?” IEEE Trans. Inform. Theory , vol. 52, no. 12, pp. 5406–5425, Dec. 2006
2006
Cited alongside, same era.
D. L. Donoho, “Compressed sensing,” IEEE Trans. Inform. Theory , vol. 52, no. 4, pp. 1289–1306, Apr. 2006
2006
Cited alongside, same era.
E. J. Candès and J. Romberg, “Encoding the ℓ p \ell_{p} ball from limited measurements,” in Proc. IEEE Data Compression Conf. , Snowbird, UT, Mar. 2006, pp. 33–42
2006
Cited alongside, same era.
2009
Later among the works it cites.
A. Zymnis, S. Boyd, and E. Candès, “Compressed sensing with quantized measurements,” IEEE Signal Process. Lett. , vol. 17, no. 2, pp. 149–152, Feb. 2010
2010
Later among the works it cites.
A. M. Powell, “Mean squared error bounds for the Rangan–Goyal soft thresholding algorithm,” Appl. Comput. Harm. Anal. , vol. 29, no. 3, pp. 251–271, Nov. 2010
2010
Later among the works it cites.
2010
Later among the works it cites.
——, “Estimation with random linear mixing, belief propagation and compressed sensing,” in Proc. Conf. on Inform. Sci. & Sys. , Princeton, NJ, Mar. 2010, pp. 1–6
2010
Later among the works it cites.
D. Baron, S. Sarvotham, and R. G. Baraniuk, “Bayesian compressive sensing via belief propagation,” IEEE Trans. Signal Process. , vol. 58, no. 1, pp. 269–280, Jan. 2010
2010
Later among the works it cites.
2010
Later among the works it cites.
L. Jacques, D. K. Hammond, and J. M. Fadili, “Dequantizing compressed sensing: When oversampling and non-Gaussian constraints combine,” IEEE Trans. Inform. Theory , vol. 57, no. 1, pp. 559–571, Jan. 2011
2011
Closest in time.
J. N. Laska, P. T. Boufounos, M. A. Davenport, and R. G. Baraniuk, “Democracy in action: Quantization, saturation, and compressive sensing,” Appl. Comput. Harm. Anal. , vol. 31, no. 3, pp. 429–443, Nov. 2011
2011
Closest in time.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Trans. Inform. Theory , vol. 57, no. 2, pp. 764–785, Feb. 2011
2011
Closest in time.
V. Misra, V. K. Goyal, and L. R. Varshney, “Distributed scalar quantization for computing: High-resolution analysis and extensions,” IEEE Trans. Inform. Theory , vol. 57, no. 8, pp. 5298–5325, Aug. 2011
2011
Closest in time.