Identical-capacity channel decomposition for design of Universal LDPC codes

IEEE Transactions on Communications

Volumn 57, Issue 7, 2009, Pages 1972-1981

  Sanaei, Ali ^a   Ramezani, Mahdi ^a   Ardakani, Masoud ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Channel decomposition; Channel state information (CSI); Code design; Irregular low density paritycheck (LDPC) codes; Subchannel; Universal codes

Indexed keywords

CHANNEL DECOMPOSITION; CHANNEL STATE INFORMATION (CSI); CODE DESIGN; IRREGULAR LOW-DENSITY PARITYCHECK (LDPC) CODES; SUBCHANNEL; UNIVERSAL CODES;

CHANNEL STATE INFORMATION; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); DESIGN; SIGNAL ENCODING;

FORTH (PROGRAMMING LANGUAGE);

EID: 68249138201     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.07.070619     Document Type: Article

References (28)

1. R. D. Wesel, X. Liu, and W. Shi, "Trellis codes for periodic erasures," IEEE Trans. Commun., vol. 48, no. 6, pp. 938-947, June 2000.
2. M. B. Pursley and J. S. Skinner, "Decoding strategies for turbo product codes in frequency-hop wireless communications," in Proc. IEEE Int. Conf. Commun. (ICC), vol. 4, May 2003, pp. 2963-2968.
3. C. Jones, A. Matache, T. Tian, J. Villasenor, and R. Wesel, "The universality of LDPC codes on wireless channels," in Proc. IEEE Military Commun. Conf. (MILCOM), vol. 1, Oct. 2003, pp. 440-445.
4. C. Köse and R. D. Wesel, "Universal space-time trellis codes," IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2717-2727, Oct. 2003.
5. X. Jin, T. Li, O. M. Collins, and T. E. Fuja, "The universality of LDPC codes on correlated fading channels with decision feedback based receiver," in IEEE Global Telecommn. Conf. (GLOBECOM), vol. 3, Nov./Dec. 2005.
6. J. Shi and R. D. Wesel, "A study on universal codes with finite block lengths," IEEE Trans. Inform. Theory, vol. 53, no. 9, pp. 3066-3074, Sept. 2007.
7. C. E. Shannon, "A mathematical theory of communication," Bell System Tech. J., vol. 27, pp. 379-423 and 623-656, July/Oct. 1948.
8. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
9. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
10. S. Miyake and M. Maruyama, "Construction of universal codes using LDPC matrices and their error exponents," IEICE Trans. Fundamentals, vol. E90-A, pp. 1830-1839, 2007.
11. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
12. S.-Y. Chung, G. D. Forney Jr., T. J. Richardson, and R. L. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, no. 2, pp. 58-60, Feb. 2001.
13. S.-Y. Chung, "On the construction of some capacity-approaching coding schemes," Ph.D. dissertation, MIT, 2000.
14. M. Franceschini, G. Ferrari, and R. Raheli, "Does the performance of LDPC codes depend on the channel?" IEEE Trans. Commun., vol. 54, no. 12, pp. 2129-2132, Dec. 2006.
15. F. Peng, W. Ryan, and R. Wesel, "Surrogate-channel design of universal LDPC codes," IEEE Commun. Lett., vol. 10, no. 6, 2006.
16. A. Amraoui, "LdpcOpt, optimization of the degree distrbutions of LDPC ensembles." Online. Available: http://lthcwww.epfl.ch/ research/ldpcopt/.
17. I. Land, S. Huettinger, P. Hoeherand, and J. Huber, "Bounds on information combining," IEEE Trans. Inform. Theory, vol. 51, no. 2, pp. 612-619, 2005.
18. I. Sutskover, S. Shamai, and J. Ziv, "Constrained information combining: Theory and applications for LDPC coded systems," IEEE Trans. Inform. Theory, vol. 53, no. 5, pp. 1617-1643, May 2007.
19. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
20. T. Richardson and R. Urbanke, Modern Coding Theory. New York: Cambridge University Press, 2008.
21. W. Yu, M. Ardakani, B. Smith, and F. Kschischang, "Complexityoptimized low-density parity-check codes for Gallager decoding algorithm B," in Proc. IEEE Int. Symp. on Inform. Theory (ISIT), Sept. 2005, pp. 1488-1492.
22. M. Ardakani and F. R. Kschischang, "Designing irregular LDPC codes using EXIT charts based on message error probability," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Lausanne, Switzerland, July 2002, p. 454.
23. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. Commun., vol. 52, no. 4, pp. 670-678, Apr. 2004.
24. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryles Systems. Academic Press, 1981.
25. M. Tuchler and J. Hagenauer, "EXIT charts and irregular codes," in Proc. Conf. Inform. Sci. Sys., Princeton, USA, Mar. 2002, pp. 748-753.
26. M. Ardakani and F. R. Kschischang, "A more accurate one-dimensional analysis and design of LDPC codes," IEEE Trans. Commun., vol. 52, no. 12, pp. 2106-2114, Dec. 2004.
27. S.-Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sumproduct decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
28. T. Richardson and R. Urbanke, "Fixed points and stability of density evolution," Commun. Inform. Systems, vol. 4, no. 1, pp. 103-116, 2004.