TY - GEN
T1 - Large system analysis of projection based algorithms for the MIMO broadcast channel
AU - Guthy, Christian
AU - Utschick, Wolfgang
AU - Honig, Michael L.
PY - 2010/8/23
Y1 - 2010/8/23
N2 - Analytical results for the average sum rate achievable in the Multiple-Input Multiple-Output (MIMO) broadcast channel with algorithms relying on full channel state information at the transmitter are hard to obtain in practice. In the large system limit, when the number of transmit and receive antennas goes to infinity at a finite fixed ratio, however, the eigenvalues of many random matrices become deterministic and analytical expressions for the sum rate can be derived in some cases. In this paper we will present large system expressions for the sum rate for three sub-optimum algorithms, namely the Successive Encoding Successive Allocation Method (SESAM), Block Diago-nalization and Block Diagonalization with Dirty Paper Coding. In case the large system limit of the sum rate does not exist, we derive lower bounds. By simulation results it is shown that the asymptotic results serve as a good approximation of the system performance with finite system parameters of reasonable size.
AB - Analytical results for the average sum rate achievable in the Multiple-Input Multiple-Output (MIMO) broadcast channel with algorithms relying on full channel state information at the transmitter are hard to obtain in practice. In the large system limit, when the number of transmit and receive antennas goes to infinity at a finite fixed ratio, however, the eigenvalues of many random matrices become deterministic and analytical expressions for the sum rate can be derived in some cases. In this paper we will present large system expressions for the sum rate for three sub-optimum algorithms, namely the Successive Encoding Successive Allocation Method (SESAM), Block Diago-nalization and Block Diagonalization with Dirty Paper Coding. In case the large system limit of the sum rate does not exist, we derive lower bounds. By simulation results it is shown that the asymptotic results serve as a good approximation of the system performance with finite system parameters of reasonable size.
UR - http://www.scopus.com/inward/record.url?scp=77955679148&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955679148&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2010.5513449
DO - 10.1109/ISIT.2010.5513449
M3 - Conference contribution
AN - SCOPUS:77955679148
SN - 9781424469604
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2128
EP - 2132
BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010
Y2 - 13 June 2010 through 18 June 2010
ER -