Accelerating the convergence of message passing on loopy graphs using eigenmessages

Conference Record of the Asilomar Conference on Signals, Systems and Computers

Volumn 1, Issue , 2003, Pages 79-83

  Chauhan, Ojas S ^a   Moon, Todd K ^a   Gunther, Jacob H ^a  

^a UTAH STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENMESSAGES; LOOPY GRAPHS; MASSAGE PASSING (MP); TANNER GRAPHS;

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; ITERATIVE METHODS;

DECODING;

EID: 4143048975     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. R. Gallager, "Low-density parity-check codes," IRE Transactions on Information Theory, vol. IT-8, pp. 21-28, Jan 1962.
2. R. Gallager, Low-density parity-check. PhD thesis, M.I.T., Cambridge, MA, 1963.
3. D. J. MacKay and R. M. Neal, "Good codes based on very sparse matrices," in Cryptography and Coding 5th IMA Conference (C. Boyd, ed.), vol. 1025 of Lecture Notes in Computer Science, pp. 100-111, Springer, Spring 1995.
4. D. J. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Info. Theory., vol. 45, pp. 399-431, March 1999.
5. S.-Y. Chung, G. D. Forney, Jr., T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 db of the shannon limit," IEEE Commun. Letters, vol. 5, pp. 58-60, Feb. 2001.
6. D. J. MacKay, ''Near Shannon limit performance of low density parity check codes," Eletronics Letters, vol. 33, pp. 457-458, Mar 1997.
7. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Info. Theory., vol. IT-27, pp. 533-547, Sept. 1981.
8. R. J. McEliece, D. J. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of Pearl's belief propogation algorithm," IEEE J. on Selected Areas in Comm., vol. 16, pp. 140-152, Feb. 1998.
9. S. M. Aji and R. J. McEliece, "The generalized distributive law," IEEE Trans. Info. Theory., vol. 46, pp. 325-343, March 2000.
10. B. J. Frey and D. J. C. MacKay, "A revolution: Belief propagation in graphs with cycles," in Advances in Neural Information Processing Systems (M. I. Jordan, M. J. Kearns, and S. A. Solla, eds.), vol. 10, pp. 470-485, The MIT Press, 1998.
11. R. J. McEliece, E. R. Rodemich, and J.-F. Cheng, "The turbo decision algorithm," in Proc. 33rd Annual Allerton Conference on Comm., Control, and Computing, (Monticello, IL), pp. 366-375, 1995.
12. Y. Weiss, "Correctness of local probability propagation in graphical models with loops," Neural Computation, vol. 12, pp. 1-41, 2000.
13. M. R. Yazdani, S. Hemati, and A. H. Banihashemi, "Improving belief propogation on graphs with cycles," in Proceedings of the 2003 Canadian Workshop on Information Theory, CWIT 2003, (Waterloo, Ontario, Canada), pp. 235-238, May 18-21 2003.
14. Y. Mao and A. H. Banihashemi, "Decoding low-density parity-check codes with probabilistic schedule," IEEE Comm. Letters, vol. 5, pp. 414-416, Oct. 2001.
15. J. R. Barry, "Low-density parity-check codes." http:// users.ece.gatech.edu/~barry/6606/handouts/ldpc.pdf, Oct. 2001.