A simple and accurate approximation for the sum rate of zero forcing dirty paper precoding with greedy user selection

Seunghun Jang, Jeong Wook Seo, Dong Ku Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose a simple and accurate approximation method for the sum rate of greedy zero forcing dirty paper coding (G-ZFDPC). Specifically, we consider a single cell scenario when there exist large number of users. We use a simple probablistic analysis and drive a quite accurate approximation for the sum rate of G-ZFDPC. The existing approximation results are rather complicated, while our approximation is easily applicable.

Original languageEnglish
Title of host publication11th International Conference on Advanced Communication Technology, ICACT 2009 - Proceedings
Pages2299-2301
Number of pages3
Volume3
Publication statusPublished - 2009 Jul 10
Event11th International Conference on Advanced Communication Technology, ICACT 2009 - Phoenix Park, Korea, Republic of
Duration: 2009 Feb 152009 Feb 18

Other

Other11th International Conference on Advanced Communication Technology, ICACT 2009
CountryKorea, Republic of
CityPhoenix Park
Period09/2/1509/2/18

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Jang, S., Seo, J. W., & Kim, D. K. (2009). A simple and accurate approximation for the sum rate of zero forcing dirty paper precoding with greedy user selection. In 11th International Conference on Advanced Communication Technology, ICACT 2009 - Proceedings (Vol. 3, pp. 2299-2301). [4809538]