Monotonic optimization based decoding for linear codes
- 243 Downloads
New efficient methods are developed for the optimal maximum-likelihood (ML) decoding of an arbitrary binary linear code based on data received from any discrete Gaussian channel. The decoding algorithm is based on monotonic optimization that is minimizing a difference of monotonic (d.m.) objective functions subject to the 0–1 constraints of bit variables. The iterative process converges to the global optimal ML solution after finitely many steps. The proposed algorithm’s computational complexity depends on input sequence length k which is much less than the codeword length n, especially for a codes with small code rate. The viability of the developed is verified through simulations on different coding schemes.
KeywordsLinear codes Low density parity check (LDPC) codes Maximum likelihood decoding Global optimization
Unable to display preview. Download preview PDF.
- 4.Gallager R.G.: Low Density Parity Check Codes. MIT Press, Cambridge (1962)Google Scholar
- 7.LDPC toolkit for Matlab. http://arun-10.tripod.com/ldpc/ldpc.htm
- 13.Pearl J.: Probabilistic Reasoning in Intelligent Systems. Margan Kaufmann, Los Altos (1988)Google Scholar
- 15.Tuy H.: Convex Analysis and Global Optimization. Kluwer Academic, New York (1999)Google Scholar
- 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)Google Scholar