Convergence of the conditional per symbol entropy for stationary Gaussian fading channels for almost all input sequences


M. Dörpinghaus, N. Gaffke, L. Imhof, R. Mathar,


        In the present work, a discrete-time stationary Rayleigh flat-fading channel with unknown channel state infor- mation at the transmitter and the receiver is considered. The law of the channel is assumed to be known at the receiver and the fading process is supposed to be a stationary Gaussian process with an absolutely summable autocorrelation function. The conditional per symbol entropy of the output given the input is shown to converge to a constant for almost every realization of i.i.d. input variables. This implies the existence of the corresponding conditional entropy rate. Moreover, a novel inequality yielding a lower bound for the rate is derived.

BibTEX Reference Entry 

	author = {Meik D{\"o}rpinghaus and Norbert Gaffke and Lorens Imhof and Rudolf Mathar},
	title = "Convergence of the conditional per symbol entropy for stationary {G}aussian fading channels for almost all input sequences",
	pages = "1-3",
	booktitle = "2013 Information Theory and Applications Workshop",
	address = {San Diego, CA, USA},
	month = Feb,
	year = 2013,
	hsb = hsb999910312249 ,


 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.