By Topic

On the Achievable Rate of Stationary Rayleigh Flat-Fading Channels With Gaussian Inputs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dorpinghaus, M. ; Inst. for Theor. Inf. Technol., RWTH Aachen Univ., Aachen, Germany ; Meyr, H. ; Mathar, R.

In this work, a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver side is studied. The law of the channel is presumed to be known to the receiver. For independent identically distributed (i.i.d.) zero-mean proper Gaussian input distributions, the achievable rate is investigated. The main contribution of this paper is the derivation of two new upper bounds on the achievable rate with Gaussian input symbols. One of these bounds is based on the one-step channel prediction error variance but is not restricted to peak power constrained input symbols like known bounds. Moreover, it is shown that Gaussian inputs yield the same pre-log as the peak power constrained capacity. The derived bounds are compared with a known lower bound on the capacity given by Deng and Haimovich and with bounds on the peak power constrained capacity given by Sethuraman et al.. Finally, the achievable rate with i.i.d. Gaussian input symbols is compared to the achievable rate using a coherent detection in combination with a solely pilot-based channel estimation.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 4 )