Please use this identifier to cite or link to this item:
|Title:||Transmitter optimization for distributed Gaussian MIMO channels|
|Authors:||Chong, H.-F. |
|Source:||Chong, H.-F.,Motani, M.,Nan, F. (2010). Transmitter optimization for distributed Gaussian MIMO channels. 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings : 323-328. ScholarBank@NUS Repository. https://doi.org/10.1109/ITA.2010.5454104|
|Abstract:||In this paper, we consider the transmitter optimization problem for a point-to-point communication system with multiple base-stations cooperating to transmit to a single user. Each base-station is equipped with multiple antennas with a separate average power constraint imposed on it. First, we determine certain sufficient conditions for optimality which, in turn, motivate the development of a simple water-filling algorithm that can be applied if H T H is positive definite (H is the composite channel matrix). The water-filling algorithm is applied to each individual base-station and the symmetric matrix thus obtained is the optimal transmit covariance matrix if it is also positive semi-definite and none of its diagonal elements are zero. Secondly, we show that for a special class of distributed Gaussian MIMO channels, where the individual channel matrices have the same unitary left singular vector matrix, the transmitter optimization problem may be reduced from one of determining the optimal transmit covariance matrix of size N x N to that of determining an optimal vector of length N. Finally, we propose a low-complexity, greedy water-filling algorithm for general channel matrices. The proposed algorithm is shown to attain near optimal rates in various scenarios through numerical simulations.|
|Source Title:||2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 20, 2018
checked on Feb 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.