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

Authors:
Seunghun Jang;Jeong-Wook Seo;Dong Ku Kim
Affiliations:
Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea;Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea;Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea
Venue:
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Year:
2009

Citing 8
Cited 0

On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm

IEEE Transactions on Signal Processing - Part I
Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels

IEEE Transactions on Signal Processing
On the achievable throughput of a multiantenna Gaussian broadcast channel

IEEE Transactions on Information Theory
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality

IEEE Transactions on Information Theory
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels

IEEE Transactions on Information Theory
Sum capacity of Gaussian vector broadcast channels

IEEE Transactions on Information Theory
On the capacity of MIMO broadcast channels with partial side information

IEEE Transactions on Information Theory
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.