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]
Jang, Seunghun ; Seo, Jeong Wook ; Kim, Dong Ku. / A simple and accurate approximation for the sum rate of zero forcing dirty paper precoding with greedy user selection. 11th International Conference on Advanced Communication Technology, ICACT 2009 - Proceedings. Vol. 3 2009. pp. 2299-2301
@inproceedings{83723f3c68434aa588f263136756e671,
title = "A simple and accurate approximation for the sum rate of zero forcing dirty paper precoding with greedy user selection",
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.",
author = "Seunghun Jang and Seo, {Jeong Wook} and Kim, {Dong Ku}",
year = "2009",
month = "7",
day = "10",
language = "English",
isbn = "9788955191387",
volume = "3",
pages = "2299--2301",
booktitle = "11th International Conference on Advanced Communication Technology, ICACT 2009 - Proceedings",

}

Jang, S, Seo, JW & Kim, DK 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, 4809538, pp. 2299-2301, 11th International Conference on Advanced Communication Technology, ICACT 2009, Phoenix Park, Korea, Republic of, 09/2/15.

A simple and accurate approximation for the sum rate of zero forcing dirty paper precoding with greedy user selection. / Jang, Seunghun; Seo, Jeong Wook; Kim, Dong Ku.

11th International Conference on Advanced Communication Technology, ICACT 2009 - Proceedings. Vol. 3 2009. p. 2299-2301 4809538.

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

TY - GEN

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

AU - Jang, Seunghun

AU - Seo, Jeong Wook

AU - Kim, Dong Ku

PY - 2009/7/10

Y1 - 2009/7/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=67649884057&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649884057&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9788955191387

VL - 3

SP - 2299

EP - 2301

BT - 11th International Conference on Advanced Communication Technology, ICACT 2009 - Proceedings

ER -

Jang S, Seo JW, Kim DK. 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. 2009. p. 2299-2301. 4809538