TY - GEN
T1 - Near maximum sum-rate non-zero-forcing linear precoding with successive user selection
AU - Schmidt, David A.
AU - Joham, Michael
AU - Hunger, Raphael
AU - Utschick, Wolfgang
PY - 2006
Y1 - 2006
N2 - We investigate the problem of finding the linear precoder that maximizes the sum-rate for the vector broadcast channel. In contrast to previous work, we examine the dual uplink problem, where the optimal power allocation must be found. This point of view leads to the observation that considering only uniform power allocations on a user subset yields nearly optimal performance, simplfying the problem to a combinatorial problem. We furthermore present two algorithms with complexity growing only quadratically with the number of users in the system, but with performance comparable to more complex existing schemes.
AB - We investigate the problem of finding the linear precoder that maximizes the sum-rate for the vector broadcast channel. In contrast to previous work, we examine the dual uplink problem, where the optimal power allocation must be found. This point of view leads to the observation that considering only uniform power allocations on a user subset yields nearly optimal performance, simplfying the problem to a combinatorial problem. We furthermore present two algorithms with complexity growing only quadratically with the number of users in the system, but with performance comparable to more complex existing schemes.
UR - http://www.scopus.com/inward/record.url?scp=47049128062&partnerID=8YFLogxK
U2 - 10.1109/ACSSC.2006.355136
DO - 10.1109/ACSSC.2006.355136
M3 - Conference contribution
AN - SCOPUS:47049128062
SN - 1424407850
SN - 9781424407859
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 2092
EP - 2096
BT - Conference Record of the 40th Asilomar Conference on Signals, Systems and Computers, ACSSC '06
T2 - 40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06
Y2 - 29 October 2006 through 1 November 2006
ER -