Skip to main content

Duality, Dirty Paper Coding, and Capacity for Multiuser Wireless Channels

  • Chapter
Information, Coding and Mathematics

Abstract

We determine a duality between broadcast and multiple access channels that can be used to obtain the capacity region and optimal transmission strategy for one channel based on the capacity-achieving transmission strategy and region for the dual channel. This duality result in applicable to additive Gaussian noise and fading channels for several different notions of fading channel capacity, including ergodic capacity, outage capacity, and minimum rate capacity. We show that duality can be used to obtain any of these capacities for the fading broadcast channel from the same capacity on the dual MAC channel, and vice versa. We then apply this general result to obtain the minimum rate capacity of the fading multiple access channel, which also yields the ergodic and outage capacity as special cases. Next we turn our attention to broadcast channels with multiple antennas at the transmitter and receiver (the MIMO channel). Since this channel is in general non-degraded, its capacity region remains an unsolved problem. We establish a duality between the achievable region of the MIMO broadcast channel using Costa’s “dirty-paper” coding and the capacity region of the MIMO multiple-access channel, which is easy to compute. We also show that the dirty paper achievable region yields the sum-rate capacity of the MIMO broadcast channel.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. G. Caire and S. Shamai, “On Achievable Rates in a Multi-antenna Broadcast Downl ink”, 38th Annual Allerton Conference on Commun., Control and Computing, Monticello, I L, Oct. 4–6, 2000.

    Google Scholar 

  2. M. Costa, “Writing on Dirty Paper”, IEEE. Trans. Inf. Theory, v. 29, pp. 439–4 41, May 1983.

    Article  Google Scholar 

  3. R. J. McEliece and W. Stark, “Channels with block interference,” IEEE Trans. Info. Theory, pp. 44–53, Nov. 1984.

    Google Scholar 

  4. E. Biglieri, J. Proakis, and S. Shamai, “Fading channels: information-theoretic and communications aspects,” IEEE Trans. Info. Theory, pp. 2619–2692, Oct. 1998.

    Google Scholar 

  5. R. J. McEliece and L. Swanson, “A note on the wideband broadcast channel,” IEEE Trans. Commun., pp. 452–453, April 1987.

    Google Scholar 

  6. T. Cover, R. J. McEliece, and E. C. Posner, “Multiple access channel capacity is attainable without synchronization,” IEEE Trans. Info. Theory, pp. 409–413, Jan. 1981.

    Google Scholar 

  7. S. Verdú, “Spectral efficiency in the wideband regime,” To appear: IEEE Trans. Info. Theory,April 2002.

    Google Scholar 

  8. S. Verdú, G. Caire, and D. Tuninetti, “Is TDMA wideband optimal,” To appear: Proc. IEEE Intl. Symp. Info. Theory,June 2002.

    Google Scholar 

  9. A. Lapidoth, I. E. Teletar, and R. Urbanke, “On wideband broadcast channels,” Proc. IEEE Intl. Symp. Info. Theory, pp. 188, Aug. 1998.

    Google Scholar 

  10. S. Verdú, “Multiple-access channels with memory with and without frame synchronism,” IEEE Trans. Info. Theory, pp. 605–619, May 1989.

    Google Scholar 

  11. S. Verdú, “The capacity region of the symbol-asynchronous Gaussian multiple-access channel,” IEEE Trans. Info. Theory, pp. 733751, July 1989.

    Google Scholar 

  12. M.R. Carey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York, 1979.

    Google Scholar 

  13. R. J. McEliece and K. N. Sivarajan, “Performance limits for channelized cellular telephone systems,” IEEE Trans. Info. Theory, pp. 21–34, Jan. 1994.

    Google Scholar 

  14. R. J. McEliece and S. Deora, “Asymptotic performance analysis of a timid DCA algorithm,” Proc. Conf. Inform. Sciences and Systems, March 1995.

    Google Scholar 

  15. I. Katzela and M. Naghshineh, “Channel assignment schemes for cellular mobile telecommunication systems - a comprehensive survey,” IEEE Pers. Commun. Mag., pp. 10-31, June 1996.

    Google Scholar 

  16. N. Jindal, S. Vishwanath, and A. J. Goldsmith, “On the duality of multiple-access and broadcast channels,” Proc. IEEE Allerton Conf. Commun. Cont. Comput., Oct. 2001.

    Google Scholar 

  17. L. Li and A. Goldsmith, “Capacity and optimal resource allocation for fading broadcast channels: Part I: Ergodic capacity”, IEEE Trans. Inform. Theory, vol. 47, pp 1083–1102, March 2001.

    Article  MathSciNet  MATH  Google Scholar 

  18. D.N. Tse and S. Hanly, “Multi-Access Fading Channels: Part I: Polymatroid Struct ure, Optimal Resource Allocation and Throughput Capacities”, IEEE Trans. Inform. Theory, v. 44, pp 2796–2815, Nov. 1998.

    Article  MathSciNet  MATH  Google Scholar 

  19. L. Li and A. Goldsmith, “Capacity and optimal resource allocation for fading broadcast channels: Part II: Outage capacity”, IEEE Trans. Inform. Theory, vol. 47, pp 1103–1127, March 2001.

    Article  MathSciNet  MATH  Google Scholar 

  20. S.V. Hanly and D. N. Tse, “Multiaccess fading channels- Part II:Delay-limited capacities”, IEEE Trans. Inform. Theory, vol. 44, pp. 2816–2831, Nov. 1998.

    Article  MathSciNet  MATH  Google Scholar 

  21. L. Li and A. Goldsmith, “Outage capacities and optimal power allocation for fading multiple-access channels”, in revision for IEEE Trans. Inform. Theory. See also Proc. IEEE Intl. Symp. Inform. Theory, pg. 305, June 2000.

    Google Scholar 

  22. N. Jindal and A. Goldsmith, “Capacity and optimal power allocation for fading broadcast channels with minimum rates”, Proc. IEEE Globecom, pp. 1292–1296, Nov. 2001.

    Google Scholar 

  23. N. Jindal, S. Vishwanath, and A. J. Goldsmith, “Duality of multiple-access and broadcast channels,” In preparation for submission to IEEE Trans. Inform. Theory.

    Google Scholar 

  24. E. Telatar, “Capacity of Multi-antenna Gaussian Channels,” European Trans. on Telecomm. ETT, 10 (6): 585–596, November 1999.

    Google Scholar 

  25. W. Yu, W. Rhee, S. Boyd, J. Cioffi, “Iterative Water-filling for Vector Multipl e Access Channels”, pp. 322, Proc. IEEE Int. Symp. Inf. Theory, (ISIT), Washington DC, June 24–29, 2001.

    Google Scholar 

  26. W. Yu and J. Cioffi, “Trellis Precoding for the Broadcast Channel”, Proc. IEEE Globecom, pp. 1344–1338, Nov., 2001.

    Google Scholar 

  27. S. Vishwanath, N. Jindal, and A. J. Goldsmith, “On the capacity of multiple input multiple output broadcast channels,” To appear: Proc. IEEE Intl. Conf. Commun.,April 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Jindal, N., Vishwanath, S., Goldsmith, A. (2002). Duality, Dirty Paper Coding, and Capacity for Multiuser Wireless Channels. In: Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds) Information, Coding and Mathematics. The Springer International Series in Engineering and Computer Science, vol 687. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3585-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3585-7_15

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5289-9

  • Online ISBN: 978-1-4757-3585-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics