The Achievable Rate of Stationary Rayleigh Flat-Fading Channels with IID Input Symbols

Authors

M. Dörpinghaus, H. Meyr, G. Ascheid,

Abstract

        In this work, we derive a new upper bound on the achievable rate of stationary Rayleigh flat-fading channels with i.i.d. input symbols. The novelty lies in the fact that this bound is not restricted to peak power constrained input symbols like known bounds, e.g., in [1] or [2]. Therefore, the derived upper bound can also be used to evaluate the achievable rate with i.i.d. proper Gaussian input symbols, which are capacity achieving in the coherent case. The derivation of the upper bound is based on the prediction error variance of the one-step channel predictor.

BibTEX Reference Entry 

@inproceedings{DoMeAs10,
	author = {Meik D{\"o}rpinghaus and Heinrich Meyr and Gerd Ascheid},
	title = "The Achievable Rate of Stationary {R}ayleigh Flat-Fading Channels with IID Input Symbols",
	pages = "812-817",
	booktitle = " International Symposium on Information Theory and its Applications (ISITA 2010)",
	address = {Taichung, Taiwan},
	month = Oct,
	year = 2010,
	hsb = hsb999910017613,
	}

Downloads

 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.