Open Access Research Article

Characterization and Optimization of LDPC Codes for the 2-User Gaussian Multiple Access Channel

Aline Roumy1* and David Declercq2

Author Affiliations

1 Unité de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, Rennes Cedex 35042, France

2 ETIS/ENSEA, University of Cergy-Pontoise/CNRS, 6 Avenue du Ponceau, Cergy-Pontoise 95014, France

For all author emails, please log on.

EURASIP Journal on Wireless Communications and Networking 2007, 2007:074890 doi:10.1155/2007/74890


The electronic version of this article is the complete one and can be found online at: http://jwcn.eurasipjournals.com/content/2007/1/074890


Received:25 October 2006
Revisions received:6 March 2007
Accepted:10 May 2007
Published:26 June 2007

© 2007 Roumy and Declercq

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

We address the problem of designing good LDPC codes for the Gaussian multiple access channel (MAC). The framework we choose is to design multiuser LDPC codes with joint belief propagation decoding on the joint graph of the 2-user case. Our main result compared to existing work is to express analytically EXIT functions of the multiuser decoder with two different approximations of the density evolution. This allows us to propose a very simple linear programming optimization for the complicated problem of LDPC code design with joint multiuser decoding. The stability condition for our case is derived and used in the optimization constraints. The codes that we obtain for the 2-user case are quite good for various rates, especially if we consider the very simple optimization procedure.

References

  1. B Rimoldi, R Urbanke, A rate-splitting approach to the Gaussian multiple-access channel. IEEE Transactions on Information Theory 42(2), 364–375 (1996). Publisher Full Text OpenURL

  2. R Ahlswede, Multi-way communication channels. Proceedings of the 2nd IEEE International Symposium on Information Theory (ISIT '71), 1971, Aremenian Prague, Czech Republic, 23–52

  3. H Liao, in Multiple access channels, Ph, ed. by . D. thesis (University of Hawaii, Honolulu, Hawaii, USA, 1972)

  4. R Palanki, A Khandekar, R McEliece, Graph based codes for synchronous multiple access channels. Proceedings of the 39th Annual Allerton Conference on Communication, Control, and Computing, October 2001, Monticello, Ill, USA

  5. A Amraoui, S Dusad, R Urbanke, Achieving general points in the 2-user Gaussian MAC without time-sharing or rate-splitting by means of iterative coding. Proceedings of IEEE International Symposium on Information Theory (ISIT '02), June-July 2002, Lausanne, Switzerland, 334

  6. A De Baynast, D Declercq, Gallager codes for multiple user applications. Proceedings of IEEE International Symposium on Information Theory (ISIT '02), June-July 2002, Lausanne, Switzerland, 335

  7. FR Kschischang, BJ Frey, H-A Loeliger, Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory 47(2), 498–519 (2001). Publisher Full Text OpenURL

  8. J Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (Morgan Kaufmann, San Mateo, Calif, USA, 1988)

  9. RM Tanner, A recursive approach to low complexity codes. IEEE Transactions on Information Theory 27(5), 533–547 (1981). Publisher Full Text OpenURL

  10. TJ Richardson, R Urbanke, The capacity of low-density parity-check codes under message-passing decoding. IEEE Transactions on Information Theory 47(2), 599–618 (2001). Publisher Full Text OpenURL

  11. S Ten Brink, Designing iterative decoding schemes with the extrinsic information transfer chart. International Journal of Electronics and Communications 54(6), 389–398 (2000)

  12. A Roumy, S Guemghar, G Caire, S Verdú, Design methods for irregular repeat-accumulate codes. IEEE Transactions on Information Theory 50(8), 1711–1727 (2004). Publisher Full Text OpenURL

  13. A Bennatan, D Burshtein, On the application of LDPC codes to arbitrary discrete-memoryless channels. IEEE Transactions on Information Theory 50(3), 417–438 (2004). Publisher Full Text OpenURL

  14. C-C Wang, SR Kulkarni, HV Poor, Density evolution for asymmetric memoryless channels. IEEE Transactions on Information Theory 51(12), 4216–4236 (2005). Publisher Full Text OpenURL

  15. S-Y Chung, TJ Richardson, R Urbanke, Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation. IEEE Transactions on Information Theory 47(2), 657–670 (2001). Publisher Full Text OpenURL

  16. X-Y Hu, E Eleftheriou, D-M Arnold, Progressive edge-growth tanner graphs. Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '01), November 2001, San Antonio, Tex, USA 2, 995–1001

  17. T Tian, C Jones, JD Villasenor, RD Wesel, Construction of irregular LDPC codes with low error floors. Proceedings of IEEE International Conference on Communications (ICC '03), May 2003, Anchorage, Alaska, USA 5, 3125–3129

  18. TJ Richardson, MA Shokrollahi, R Urbanke, Design of capacity-approaching irregular low-density parity-check codes. IEEE Transactions on Information Theory 47(2), 619–637 (2001). Publisher Full Text OpenURL