Equalization on graphs: Linear programming and message passing

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 2551-2555

  Taghavi, Mohammad H ^a   Siegel, Paul H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM;

CYBERNETICS; DECODING; DYNAMIC PROGRAMMING; ERROR ANALYSIS; INFORMATION THEORY; INTERSYMBOL INTERFERENCE; LINEARIZATION; MAXIMUM LIKELIHOOD ESTIMATION; MESSAGE PASSING; PARTICLE SIZE ANALYSIS; RISK ASSESSMENT; TECHNICAL PRESENTATIONS;

LINEAR PROGRAMMING;

EID: 51649099991     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557178     Document Type: Conference Paper

References (10)

1. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv. "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
2. J. Hagenauer and P. Hoecher. "A Viterbi algorithm with soft-decision outputs and its applications." in Proc. IEEE GLOBECOM, Dallas, TX, Nov. 1989, vol. 3, pp. 1680-1686.
3. B. M. Kurkoski, P. H. Siegel, and J. K. Wolf, "Joint message-passing decoding of LDPC codes and partial-response channels," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1410-1422, Jun. 2002.
4. J. Feldman, M. J. Wainwrighl, and D. Karger, "Using linear programming to decode binary linear codes." IEEE Trans. Inform. Theory, vol. 51, no. 3, pp. 954-972, Mar. 2005.
5. L. J. Wallers, "Reduction of integer polynomial programming problems to zero-one linear programming problems," Operations Research, vol. 15, no. 6, pp. 1171-1174, Nov.-Dec. 1967.
6. C. Lemaréchal and F. Oustry, "Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization." Rapport de Recherche no. 3710, INRIA, Jun. 1999.
7. M.X. Goemans and D.P. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," J. ACM, vol. 42, no. 6, pp. 1115-1145, Nov. 1995
8. J. M. W. Rhys, "A selection problem of shared fixed costs and network flows," Management Sci, vol. 17, no. 3, pp.200-207, Nov. 1970.
9. C. Sankaran and A. Kphremides, "Solving a class of optimum multiuser detection problems with polynomial complexity," IEEE Traits. Inform. Theory, vol. 44, no. 5, pp. 1958-1961, Sep. 1998.
10. M. H. Taghavi and P. H. Siegel. "Graph-based decoding in the presence of ISI," In preparation.