Message passing resource allocation for the uplink of multicarrier systems

IEEE International Conference on Communications

Volumn , Issue , 2009, Pages

  Abrardo, Andrea ^a   Detti, Paolo ^a   Moretti, Marco ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFORT; COMPUTATIONAL LOADS; DISTRIBUTED ALLOCATION; DISTRIBUTED RESOURCE ALLOCATION; INFORMATION MESSAGES; MULTI CARRIER SYSTEMS; NUMERICAL RESULTS; OPTIMAL RESOURCE ALLOCATION; RESOURCE ALLOCATION PROBLEM;

COMMUNICATION CHANNELS (INFORMATION THEORY); MULTICARRIER MODULATION; PLANNING; RESOURCE ALLOCATION; SYSTEMS ENGINEERING; TRANSMITTERS; WIRELESS TELECOMMUNICATION SYSTEMS;

MESSAGE PASSING;

EID: 70449510594     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2009.5199180     Document Type: Conference Paper

References (13)

1. T. Keller and L. Hanzo, "Adaptive Modulation Techniques for Duplex OFDM Transmissions," IEEE Trans. Veh. Techn., Vol. 49, 1893-1906, 2000
2. R. Cheng, and S. Verdu, " Gaussian multiaccess channels with ISI: capacity region and multiuser water-filling," IEEE Trans. Inf. Theory, Vol. 39, 773-785, 1993.
3. D. Kivanc, G. Li, and H. Liu, "Computationally Efficient Bandwidth Allocation and Power Control for OFDMA," IEEE Trans. Wireless Comm., Vol. 2, 1150-1158, 2003.
4. I. Kim, I. Park, and Y. Lee, "Use of Linear Programming for Dynamic Subcarrier and Bit Allocation in MultiUser OFDM," IEEE Trans. Vehic. Technol., Vol. 55, 1195-1207, 2006.
5. W. Rhee, and J. Cioffi, "Increase in capacity of multiuser OFDM System Using Dynamic Subchannel Allocation," Proc. IEEE VTC 2000 Spring 1085-1089, 2000.
6. J. Jang, and K.B. Lee, "Transmit power adaptation for multiuser OFDM systems," IEEE Journ. Sel. Areas in Commun., Vol. 21, pp. 171-178, 2003.
7. T. Richardson, R. Urbancke, "Modern Coding Theory," Cambridge University Press, United Kingdom, 2008.
8. Garey M. R., D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
9. David J. C. Mackay, "Information Theory, Inference, and Learning Algorithms" Cambridge University Press, United Kingdom, 2003.
10. R.E. Bellman, "Dynamic Programming," Princeton University Press, 1957.
11. 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, Feb. 2001.
12. S. L. Litsyn and V. S. Shevelev, "On ensembles of low-density parity-check codes: asymptotic distance distributions," IEEE Trans. Inform Theory, Vol 48, No. 4, April 2002.
13. S. L. Litsyn and V. S. Shevelev, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform Theory, Vol 49, No. 12, Dec. 2003.