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

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2001, Pages 52-

  Lapidoth, A ^a   Moser, S M ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX PROGRAMMING BOUNDS; FLAT FADING CHANNELS; RICEAN CHANNEL;

ANTENNAS; BOUNDARY CONDITIONS; EIGENVALUES AND EIGENFUNCTIONS; FADING (RADIO); MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PIECEWISE LINEAR TECHNIQUES; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SIGNAL RECEIVERS; SIGNAL TO NOISE RATIO;

CHANNEL CAPACITY;

EID: 0034845008     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (1)