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
Publication statusPublished - 2009
Event11th International Conference on Advanced Communication Technology, ICACT 2009 - Phoenix Park, Korea, Republic of
Duration: 2009 Feb 152009 Feb 18

Publication series

NameInternational Conference on Advanced Communication Technology, ICACT
Volume3
ISSN (Print)1738-9445

Other

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

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'A simple and accurate approximation for the sum rate of zero forcing dirty paper precoding with greedy user selection'. Together they form a unique fingerprint.

Cite this