Characterization and optimization of LDPC codes for the 2-user Gaussian multiple access channel

Eurasip Journal on Wireless Communications and Networking

Volumn 2007, Issue , 2007, Pages

  Roumy, Aline ^a   Declercq, David ^b  

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSITÉ DE CERGY PONTOISE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CONSTRAINED OPTIMIZATION; ELECTROMAGNETIC WAVE PROPAGATION; GAUSSIAN NOISE (ELECTRONIC); LINEAR PROGRAMMING;

PROGRAMMING OPTIMIZATION; STABILITY CONDITION;

SIGNAL ENCODING;

EID: 34547192643     PISSN: 16871472     EISSN: 16871499     Source Type: Journal    
DOI: 10.1155/2007/74890     Document Type: Article

References (18)

1. B. Rimoldi R. Urbanke A rate-splitting approach to the Gaussian multiple-access channel. IEEE Transactions on Information Theory 42 2 1996 364 375
2. R. Ahlswede Multi-way communication channels. Proceedings of the 2nd IEEE International Symposium on Information Theory (ISIT '71) Aremenian Prague, Czech Republic 1971 23 52
3. H. Liao Multiple access channels. 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 Monticello, Ill, USA 2001
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) Lausanne, Switzerland 2002 334
6. A. De Baynast D. Declercq Gallager codes for multiple user applications. Proceedings of IEEE International Symposium on Information Theory (ISIT '02) Lausanne, Switzerland 2002 335
7. F. R. Kschischang B. J. Frey H.-A. Loeliger Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory 47 2 2001 498 519
8. J. Pearl Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann San Mateo, Calif, USA 1988
9. R. M. Tanner A recursive approach to low complexity codes. IEEE Transactions on Information Theory 27 5 1981 533 547
10. T. J. Richardson R. Urbanke The capacity of low-density parity-check codes under message-passing decoding. IEEE Transactions on Information Theory 47 2 2001 599 618
11. S. Ten Brink stenbrink@lucent.com Designing iterative decoding schemes with the extrinsic information transfer chart. International Journal of Electronics and Communications 54 6 2000 389 398
12. A. Roumy aline.roumy@irisa.fr S. Guemghar Souad.Guemghar@eurecom.fr G. Caire Giuseppe.Caire@eurecom.fr S. Verdú verdu@princeton.edu Design methods for irregular repeat-accumulate codes. IEEE Transactions on Information Theory 50 8 2004 1711 1727
13. A. Bennatan abn@eng.tau.ac.il D. Burshtein burstyn@eng.tau.ac.il On the application of LDPC codes to arbitrary discrete-memoryless channels. IEEE Transactions on Information Theory 50 3 2004 417 438
14. C.-C. Wang chihw@princeton.edu S. R. Kulkarni kulkarni@princeton.edu H. V. Poor poor@princeton.edu Density evolution for asymmetric memoryless channels. IEEE Transactions on Information Theory 51 12 2005 4216 4236
15. S.-Y. Chung T. J. 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 2001 657 670
16. X.-Y. Hu E. Eleftheriou D.-M. Arnold Progressive edge-growth tanner graphs. Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '01) San Antonio, Tex, USA 2 2001 995 1001
17. T. Tian ttian@icsl.ucla.edu C. Jones christop@icsl.ucla.edu J. D. Villasenor villa@icsl.ucla.edu R. D. Wesel wesel@ee.ucla.edu Construction of irregular LDPC codes with low error floors. Proceedings of IEEE International Conference on Communications (ICC '03) Anchorage, Alaska, USA 5 2003 3125 3129
18. T. J. Richardson M. A. Shokrollahi R. Urbanke Design of capacity-approaching irregular low-density parity-check codes. IEEE Transactions on Information Theory 47 2 2001 619 637