Convex-programming bounds on the capacity of flat-fading channels

Author

Lapidoth, Amos ; Moser, Stefan M.

Author_Institution

Signal & Inf. Process. Lab., Swiss Federal Inst. of Technol., Zurich, Switzerland

fYear

2001

fDate

2001

Firstpage

52

Abstract

We propose a technique to derive analytic upper bounds on channel capacity via its dual expression. This is demonstrated on single- and multi-antenna flat fading channels where the receiver has no side information regarding the pathwise realisation of the fading process. The results indicate that the capacity of such channels typically grows double-logarithmically in the SNR and not logarithmically as the piecewise constant fading models predict

Keywords

channel capacity; convex programming; fading channels; noise; transmitting antennas; SNR; analytic upper bounds; convex-programming bounds; dual expression; flat-fading channel capacity; i.i.d. fading; multi-antenna flat fading channels; piecewise constant fading models; probability measure; single-antenna flat fading channels; transmitting antenna; Channel capacity; Eigenvalues and eigenfunctions; Entropy; Fading; Gaussian channels; Gaussian distribution; Gaussian processes; H infinity control; Rayleigh channels; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on

Conference_Location

Washington, DC

Print_ISBN

0-7803-7123-2

Type

conf

DOI

10.1109/ISIT.2001.935915

Filename

935915