TY - GEN

T1 - On the optimal power allocation for additive color noise parallel channels with limited access constraint

AU - Wang, Shih Wei

AU - Chen, Po-Ning

AU - Wang, Chung-Hsuan

AU - Chang, Wen Chieh

PY - 2011/10/26

Y1 - 2011/10/26

N2 - In this paper, we consider an (N,K)-limited access system consisting of N parallel additive noise channels with spatial dependency, where the receiver starts to decode the information being transmitted when at least K out of N channel outputs are received. We investigate the optimal power allocation that maximizes the minimum mutual information among all possible cases of partial reception. A universal guideline is then obtained for a group of permutation-invariant channels, in which the system mutual information remains unchanged when permuting the parameters that characterize the partial reception and signal-to-noise power ratio (SNR) of channels, that a channel with less noise power should have larger SNR. When all N channels belong to a permutation-invariant group, we also have that the optimal power allocation problem can be transformed to an equivalent problem for K parallel channels without limited access constraint via a water-filling noise-power-redistribution process. The merit of this transformation can be more evidently seen when the channel input-noise pairs are reduced to be spatially independent with distributions scaled from a common random vector, for which the optimal power allocation solution can be simply obtained by a two-phase water-filling process.

AB - In this paper, we consider an (N,K)-limited access system consisting of N parallel additive noise channels with spatial dependency, where the receiver starts to decode the information being transmitted when at least K out of N channel outputs are received. We investigate the optimal power allocation that maximizes the minimum mutual information among all possible cases of partial reception. A universal guideline is then obtained for a group of permutation-invariant channels, in which the system mutual information remains unchanged when permuting the parameters that characterize the partial reception and signal-to-noise power ratio (SNR) of channels, that a channel with less noise power should have larger SNR. When all N channels belong to a permutation-invariant group, we also have that the optimal power allocation problem can be transformed to an equivalent problem for K parallel channels without limited access constraint via a water-filling noise-power-redistribution process. The merit of this transformation can be more evidently seen when the channel input-noise pairs are reduced to be spatially independent with distributions scaled from a common random vector, for which the optimal power allocation solution can be simply obtained by a two-phase water-filling process.

UR - http://www.scopus.com/inward/record.url?scp=80054812564&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2011.6034141

DO - 10.1109/ISIT.2011.6034141

M3 - Conference contribution

AN - SCOPUS:80054812564

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 336

EP - 340

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -