• DocumentCode
    3301350
  • Title

    Block fading channels with limited channel state information

  • Author

    Lembo, S. ; Yu, C.-H. ; Tirkkonen, O.

  • Author_Institution
    Dept. of Commun. & Networking, Aalto Univ., Aalto, Finland
  • fYear
    2010
  • fDate
    17-20 Oct. 2010
  • Firstpage
    807
  • Lastpage
    811
  • Abstract
    In this paper, we provide a lower bound to maximum expected rate for block fading channels with limited Channel State Information (CSI). We assume a channel fading block accommodates at least one codeword so that for block Rayleigh fading, the ergodic channel capacity is zero when no CSI is available at the transmitter. The CSI fed back to the transmitter is subject to a cardinality constraint. We derive a counting function to describe an efficient use of the available cardinality by formulating the capacity loss due to limited cardinality as a variational calculus problem. The feedback schemes with different cardinality constraints can be easily derived by scaling the counting function to fit the cardinality constraints. With Rayleigh fading channels, the feedback scheme and the corresponding lower bound of maximum expected rate can be solved in closed form. According to our results, the expected rate achieved by using the counting function is tight.
  • Keywords
    Rayleigh channels; channel capacity; CSI; block Rayleigh fading channels; cardinality constraint; counting function; ergodic channel capacity; feedback schemes; limited channel state information; lower bound; transmitter; Calculus; Channel capacity; Channel coding; Fading; Signal to noise ratio; Switches; Transmitters;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and its Applications (ISITA), 2010 International Symposium on
  • Conference_Location
    Taichung
  • Print_ISBN
    978-1-4244-6016-8
  • Electronic_ISBN
    978-1-4244-6017-5
  • Type

    conf

  • DOI
    10.1109/ISITA.2010.5649612
  • Filename
    5649612