TY - GEN
T1 - Large system capacity of MIMO block fading channels with least squares linear adaptive receivers
AU - Sun, Yakun
AU - Honig, Michael L.
PY - 2005
Y1 - 2005
N2 - The performance of a wireless channel with multiple antennas benefits from channel knowledge at the receiver, which is typically unknown a priori. We study the capacity of a block fading multiple-input/multiple-output (MIMO) channel with a linear receiver, which is estimated from a training sequence via a Least Squares (LS) algorithm. Given a fixed block size, the amount of training overhead plays a key role in balancing the quality of the receiver estimate and the data transmission time. Here we study the optimal training length, which maximizes the large system MIMO capacity, i.e., the number of transmit and receive antennas go to infinity with fixed ratio. In order to obtain a meaningful limit, the training length and packet length also increase in fixed proportion to the number of antennas. We show that the optimal amount of training grows as the square root of the block size, as the block size becomes large. Furthermore, only a slight benefit is obtained from optimizing the allocation of power across training and data symbols. Numerical results show that for a fixed block length, the capacity can be increased somewhat by adding a properly chosen diagonal loading factor to the LS algorithm.
AB - The performance of a wireless channel with multiple antennas benefits from channel knowledge at the receiver, which is typically unknown a priori. We study the capacity of a block fading multiple-input/multiple-output (MIMO) channel with a linear receiver, which is estimated from a training sequence via a Least Squares (LS) algorithm. Given a fixed block size, the amount of training overhead plays a key role in balancing the quality of the receiver estimate and the data transmission time. Here we study the optimal training length, which maximizes the large system MIMO capacity, i.e., the number of transmit and receive antennas go to infinity with fixed ratio. In order to obtain a meaningful limit, the training length and packet length also increase in fixed proportion to the number of antennas. We show that the optimal amount of training grows as the square root of the block size, as the block size becomes large. Furthermore, only a slight benefit is obtained from optimizing the allocation of power across training and data symbols. Numerical results show that for a fixed block length, the capacity can be increased somewhat by adding a properly chosen diagonal loading factor to the LS algorithm.
UR - http://www.scopus.com/inward/record.url?scp=33746657204&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746657204&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2005.1577904
DO - 10.1109/GLOCOM.2005.1577904
M3 - Conference contribution
AN - SCOPUS:33746657204
SN - 0780394143
SN - 9780780394148
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 1515
EP - 1519
BT - GLOBECOM'05
T2 - GLOBECOM'05: IEEE Global Telecommunications Conference, 2005
Y2 - 28 November 2005 through 2 December 2005
ER -