Deriving the Normalized MinSum Algorithm from Cooperative Optimization

Related identifiers: doi: 10.1109/ITW2.2006.323788 
Subject: Computer Science  Information Theoryarxiv: Computer Science::Information Theoryacm: Data_CODINGANDINFORMATIONTHEORY

References
(18)
18 references, page 1 of 2
 1
 2
[1] J. Chen and M. Fossorier, “Density evolution of two improved BPbased algorithms for LDPC decoding,” IEEE Communications Letters, vol. 6, pp. 208210, 2002.
[2] J. Chen, “Reduced complexity decoding algorithms for lowdensity parity check codes and turbo codes,” Ph.D. dissertation, University of Hawaii, Dept. of Electrical Engineering, 2003.
[3] F. R. Kschischang, B. J. Frey, and H. andrea Loeliger, “Factor graphs and the sumproduct algorithm,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 498519, February 2001.
[4] S. Aji and R. McEliece, “The generalized distributive law,” IEEE Transactions on Information Theory, vol. 46, pp. 325343, March 2000.
[5] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near shannon limit errorcorrecting coding and decoding: turbo codes,” in Proceedings of the 1993 IEEE International Conference on Communication, 1993, pp. 10641070.
[6] R. G. Gallager, “Lowdensity paritycheck codes,” Ph.D. dissertation, Department of Electrical Engineering, M.I.T., Cambridge, Mass., July 1963.
[7] D. J. C. MacKay and R. M. Neal, “Good codes based on very sparse matrices,” in Cryptography and Coding, 5th IMA Conference, December 1995.
[8] N. Wiberg, “Codes and decoding on general graphs,” Ph.D. dissertation, Department of Electrical Engineering, Linkoping University, Linkoping, Sweden, 1996.
[9] J. G. D. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268 78, Mar. 1973.
[10] J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.

Metrics
No metrics available

 Download from


Cite this publication