Counter braids: Asymptotic optimality of the message passing decoding algorithm

46th Annual Allerton Conference on Communication, Control, and Computing

Volumn , Issue , 2008, Pages 209-216

  Lu, Yi ^a   Montanari, Andrea ^b   Prabhakar, Balaji ^a  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC OPTIMALITY; DENSITY EVOLUTIONS; DIMENSIONALITY REDUCTIONS; FLOW SIZES; HIGH-SPEED LINKS; LAYERED STRUCTURES; LEAST SIGNIFICANT BITS; LOWER BOUNDS; MAXIMUM-LIKELIHOOD DECODING ALGORITHMS; MESSAGE PASSING DECODERS; MESSAGE-PASSING ALGORITHMS; MESSAGE-PASSING DECODING; SPARSE SIGNALS;

ALGORITHMS; CONTROL THEORY; DECODING; MAXIMUM LIKELIHOOD; SIGNAL RECONSTRUCTION; WEAVING;

MESSAGE PASSING;

EID: 64549111742     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2008.4797558     Document Type: Conference Paper

References (12)

1. d. Shah, s. Iyer, b. Prabhakar, and n. McKeown, "Analysis of a statistics counter architecture," in Hot Interconnects 9, Stanford, August 2001.
2. c. Estan and g. Varghese, "New directions in traffic measurement and accounting," Proceedings of ACM SIGCOMM, 2002.
3. y. Lu, a. Montanari, b. Prabhakar, s. Dharmapurikar, and a. Kabbani, "Counter braids: a novel counter architecture for per-flow measurement," in SIGMETRICS, 2008.
4. y. Lu, a. Montanari, and b. Prabhakar, "Detailed network measurements using sparse graph counters: The theory," Allerton, 2007.
5. e. Candès and t. Tao, "Near optimal signal recovery from random projections and universal encoding strategies," IEEE Trans. Inform. Theory, 2004.
6. d. l. Donoho, "Compressed Sensing," IEEE Trans. on Inform. Theory, vol. 52, pp. 1289-1306, 2006.
7. d. l. Donoho and j. Tanner, "Sparse nonnegative solutions of underdetermined linear equations by linear programming," Proc. Natl. Acad. Sci. USA, vol. 102, no. 27, pp. 9446-9451, 2005.
8. r. Berinde and p. Indyk, "Sparse recovery using sparse random matrices," Harvard Computer Science, pp. 326-327, 1999.
9. w. Xu and b. Hassibi, "Efficient compressive sensing with deterministic guarantees using expander graphs," in ITW, 2007.
10. t. Richardson and r. Urbanke, Modern Coding Theory, Cambridge University Press, 2008.
11. m. Luby, m. Mitzenmacher, a. Shokrollahi, d. a. Spielman, and v. Stemann, "Practical loss-resilient codes," in Proceedings of the 29th annual ACM Symposium on Theory of Computing, 1997, pp. 150-159.
12. m. Luby, m. Mitzenmacher, a. Shokrollahi, and d. a. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.