LDPC codes for fading gaussian broadcast channels

IEEE Transactions on Information Theory

Volumn 51, Issue 6, 2005, Pages 2173-2182

  Berlin, Peter ^a   Tuninetti, Daniela ^a,b  

^a EPFL   (Switzerland)

^b University of Illinois at Chicago   (United States)

Author keywords

Broadcast channels (BCs); Extrinsic information transfer (EXIT) charts; Fading channels; Interference cancellation; Low density parity check (LDPC) codes; Sum product algorithm

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DECODING; INTERFERENCE SUPPRESSION; OPTIMIZATION; RAYLEIGH FADING; SIGNAL RECEIVERS; WHITE NOISE;

BROADCAST CHANNELS (BCS); EXTRINSIC INFORMATION TRANSFER (EXIT) CHARTS; FADING CHANNELS; INTERFERENCE CANCELLATION; LOW DENSITY PARITY CHECK (LDPC) CODES; SUM-PRODUCT ALGORITHM;

CODES (SYMBOLS);

EID: 20544471205     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.847752     Document Type: Article

References (21)

1. T. M. Cover, "Broadcast channels," IEEE Trans. Inf. Theory, vol. IT-18, no. 1, pp. 2-14, Jan. 1972.
2. T. M. Cover, "Comments on broadcast channels," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2524-2530, Oct. 1998.
3. T. M. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
4. A. A. El Gamal, "The capacity of a class of broadcast channels," IEEE Trans. Inf. Theory, vol. IT-25, no. 2, pp. 166-169, Mar. 1979.
5. D. Tuninetti and S. Shamai (Shitz), "Gaussian broadcast channels with state information at the receivers," in Proc. DIMACS Workshop on Network Information Theory, Piscataway, NJ, Mar. 2003.
6. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
7. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
8. R. McEliece, "The effectiveness of turbo-like codes on nonstandard channel models," presented at the IEEE International Symposium on Information Theory (ISIT 2001); Planary Talk, Washington, DC, Jun. 2001.
9. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
10. J. Hou, P. H. Siegel, and L. B. Milstein, "Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels," IEEE J. Sel. Areas Commun., vol. 19, no. 5, pp. 924-934, May 2001.
11. A. Amraoui, S. Dusad, and R. Urbanke, "Achieving general points in the 2-user Gaussian MAC without time-sharing or rate-splitting by means of iterative coding," in Proc. IEEE Int. Symp. Information Theory (ISIT 2002), Lausanne, Switzerland, Jun./Jul. 2002, p. 334.
12. 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.
13. A. Amraoui, G. Kramer, and S. Shamai (Shitz), "Coding for the MIMO broadcast channel," in Proc. IEEE Int. Symp. Information Theory (ISIT 2003), Yokohama, Japan, Jun./Jul. 2003, p. 296.
14. S. ten Brink, "Convergence of iterative decoding," Electron. Lett., vol. 35, pp. 806-808, May 1999.
15. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: Model and erasure properties," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2657-2673, Nov. 2004.
16. T. J. Richardson and R. L. Urbanke. (2005) Modern Coding Theory. [Online]. Available: http://lthcwww.epfi.ch/mct/
17. S. Verdú, G. Caire, and D. Tuninetti, "Is TDMA optimal in the low power regime?," in Proc. IEEE Int. Symp. Information Theory (ISIT 2002), Lausanne, Switzerland, Jun./Jul. 2002, p. 193.
18. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
19. I. Sutskover, S. Shamai (Shitz), and J. Ziv, "Extremes in information combining," in Proc. 4th ETH - Technion Information Theory Workshop, Zurich, Switzerland, Feb. 2004.
20. I. Land, S. Huettinger, P. A. Hoeher, and J. B. Huber, "Bounds on information combining," IEEE Trans. Inf. Theory, vol. 51, no. 2, pp. 612-619, Feb. 2005.
21. A. Shokrollahi and R. Storn, "Design of efficient erasure codes with differential evolution," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, Jun./Jul. 2000, p. 5.