Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/10230/16123

Optimum power allocation for parallel Gaussian channels with arbitrary input distributions
Lozano Solsona, Àngel; Tulino, Antonia M.; Verdú, Sergio
Universitat Pompeu Fabra
The mutual information of independent parallel Gaussian-noise channels is maximized, under an average power constraint, by independent Gaussian inputs whose power is allocated according to the waterfilling policy. In practice, discrete signalling constellations with limited peak-to-average ratios (m-PSK, m-QAM, etc) are used in lieu of the ideal Gaussian signals. This paper gives the power allocation policy that maximizes the mutual information over parallel channels with arbitrary input distributions. Such policy admits a graphical interpretation, referred to as mercury/waterfilling, which generalizes the waterfilling solution and allows retaining some of its intuition. The relationship between mutual information of Gaussian channels and nonlinear minimum mean-square error proves key to solving the power allocation problem.
02-07-2013
Ràdio -- Interferències
Tractament del senyal
Gaussian Channels
Power Allocation
Waterfilling
Channel Capacity
Mutual Information
MMSE
© 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The final published article can be found at http://dx.doi.org/10.1109/TIT.2006.876220
Artículo
info:eu-repo/semantics/acceptedVersion
Institute of Electrical and Electronics Engineers (IEEE)
         

Mostrar el registro completo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

Dohler, Mischa; Heath, R. W., Jr.; Lozano Solsona, Àngel; Papadias, C. B.; Valenzuela, R. A.