Monotonic optimization based decoding for linear codes

Journal of Global Optimization

Volumn 55, Issue 2, 2013, Pages 301-312

  Tuan, H D ^a   Son, T T ^b   Tuy, H ^c   Khoa, P T ^d  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b UNIVERSITY OF NATURAL SCIENCES   (Viet Nam)

^c Institute of Mathematics   (Viet Nam)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Global optimization; Linear codes; Low density parity check (LDPC) codes; Maximum likelihood decoding

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORWARD ERROR CORRECTION; GLOBAL OPTIMIZATION; ITERATIVE METHODS; MAXIMUM LIKELIHOOD; OPTIMAL SYSTEMS;

BINARY LINEAR CODES; DECODING ALGORITHM; LINEAR CODES; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MAXIMUM LIKELIHOOD DECODING; MONOTONIC OPTIMIZATION; NEW EFFICIENT METHOD; OBJECTIVE FUNCTIONS;

DECODING;

EID: 84878535692     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-011-9816-9     Document Type: Article

References (21)

1. Berlekamp E.R.; McElice R.J.; van Tiborg H.C.A.: On the intractibility of certain coding problems. IEEE Trans. Inf. Theory 24, 384-386 (1978)
2. Feldman J.; Wainwright M.J.; Karger D.R.: Using linear programming to decode binary linear codes. IEEE Trans. Inf. Theory 51, 954-972 (2005) (Pubitemid 40377560)
3. Frank M.; Wolfe P.: An algorithm for quadratic programming. Naval Res. Log. Q. 3, 95-110 (1956)
4. Gallager R.G.: Low Density Parity Check Codes. MIT Press, Cambridge (1962)
5. Hasselberg J.; Pardalos P.M.; Vairaktarakis G.: Test case generators and computational results for the maximum clique problem. J. Glob. Optim. 3, 463-482 (1993)
6. Kschischang F.R.; Frey B.J.; Loeliger H.A.: Factor graphs and sum-product algorithm. IEEE Trans. Inf. Theory 47, 498-519 (2001) (Pubitemid 32318087)
7. LDPC toolkit for Matlab. http://arun-10.tripod.com/ldpc/ldpc.htm
8. Mackay D.J.C.; Neal R.M.: Near Shannon limit performance of low density parity check codes. Electron. Lett. 32, 1645-1646 (1996) (Pubitemid 126546283)
9. Mackay D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45, 399-431 (1999)
10. Margulis G.A.: Explicit constructions of graphs without short cycles and low density codes. Combinatorica 2, 71-78 (1982)
11. McEliece R.; MacKay D.; Cheng J.: Turbo decoding as an instance of Pearl's belief propagation algorithm. IEEE J. Sel. Areas Commun. 16, 140-152 (1998) (Pubitemid 128570649)
12. Pardalos P.M.; Romeijn E.; Tuy H.: Recent developments and trends in global optimization. J. Comput. Appl. Math. 124, 209-228 (2000) (Pubitemid 32003860)
13. Pearl J.: Probabilistic Reasoning in Intelligent Systems. Margan Kaufmann, Los Altos (1988)
14. Tanner R.M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 533-547 (1981) (Pubitemid 12446960)
15. Tuy H.: Convex Analysis and Global Optimization. Kluwer Academic, New York (1999)
16. Tuy H.; Minoux M.; Phuong N.T.H.: Discrete monotonic optimization with application to a discrete location problem. SIAM J. Optim. 17, 78-97 (2006)
17. Tuy H.: Monotonic optimization: problems and solution approaches. SIAM J. Optim. 11, 464-494 (2000) (Pubitemid 33357983)
18. Yang K.; Feldman J.; Wang X.: Nonlinear progrramming approachs to decoding low-density parity-check codes. IEEE J. Sel. Areas Commun. 24, 1603-1613 (2006)
19. Yedidia J.S.; Freeman W.T.; Weiss Y.: Understanding Belief Propagation and its Generalizations. In: Lakemeyer, G.; Nebel, B. (eds) Exploring Artificial Intelligence in the New Millenium chap 8.; pp. 239-269. Morgan Kaufmann, CA (2003)
20. Yedidia J.S.; Freeman W.T.; Weiss Y.: Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Trans. Inf. Theory 51, 2282-2312 (2005) (Pubitemid 41136394)
21. Yuille A.L.: CCCP algorithms to minimize the Bethe and Kikuchi energies: convergent alternatives to belief propagation. Neural Comput. 14, 1691-1722 (2002)