Skip to main content

Combine DPC and TDM for MIMO Broadcast Channels in Circuit Data Scenarios

  • Conference paper
Recent Progress in Data Engineering and Internet Technology

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 157))

  • 1562 Accesses

Abstract

Dirty paper coding (DPC) is shown to achieve the capacity of multiple-input multiple-output (MIMO) Gaussian broadcast channels (BCs). Finding the optimal covariance matrices and order of users for maximizing user capacity requires high complexity computation. To deal with this problem, many researchers use fixed order of users e.g. minimum power first (MPF) and get subpar performance. Meanwhile, the complexity of DPC scheme grows linearly with number of users requiring to cancel known-interference. In this paper we present a scheme combining DPC and traditional Time Division Multiplexing (TDM) that aim to maximize user capacity and reduce complexity of implementation. Simulation results show that the proposed scheme achieves better performance than that of DPC MPF scheme.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.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.

References

  1. Telatar, I.: Capacity of multi-antenna gaussian channels. Bell Laboratories, Tech. Rep. (June 1995)

    Google Scholar 

  2. Foschini, G.J., Gans, M.J.: On limits of wireless communications in a fading environment when using multiple antennas. Wireless Personal Communications 6, 311–335 (1998)

    Article  Google Scholar 

  3. Caire, G., Shamai, S.: On the achievable throughput of a multiantenna gaussian broadcast channel. IEEE Transactions on Information Theory 49(7), 1691–1706 (2003)

    Article  MathSciNet  Google Scholar 

  4. Boppana, S., Shea, J.: Downlink user capacity of cellular systems: Tdma vs dirty paper coding. In: Proc. IEEE Int. Symp. Inform. Theory, July 2006, pp. 754–758 (2006)

    Google Scholar 

  5. Viswanathan, H., Venkatesan, S., Huang, H.: Downlink capacity evaluation of cellular networks with known-interference cancellation. IEEE J. Sel. Areas Commun. 21(5), 802–811 (2003)

    Article  Google Scholar 

  6. Vishwanath, S., Jindal, N., Goldsmith, A.: Duality, Achievable Rates and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels. IEEE Transactions on Information Theory 49, 2658–2668 (2003)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yingbo Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, Y., Wang, D., Lv, G., Dong, M., Jin, Y. (2012). Combine DPC and TDM for MIMO Broadcast Channels in Circuit Data Scenarios. In: Gaol, F. (eds) Recent Progress in Data Engineering and Internet Technology. Lecture Notes in Electrical Engineering, vol 157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28798-5_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28798-5_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28797-8

  • Online ISBN: 978-3-642-28798-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics