Achievable Rate with Receivers using Iterative Channel Estimation in Stationary Fading Channels


M. Dörpinghaus, A. Ispas, H. Meyr,


        We study the achievable rate with receivers based on synchronized detection and iterative code-aided channel estimation for stationary Rayleigh flat-fading channels. The main idea behind this type of receivers is that—additionally to the pilot symbols
which are used for the initial channel estimation and coherent detection/decoding—the channel estimation is enhanced by iteratively feeding back reliability information on the data symbols acquired by the channel decoder. For a specific type of such a receiver, we derive an upper bound on the achievable rate. Based on an approximation of the upper bound, which is not a closed-form expression, we are able to upper-bound the possible performance gain when using this specific receiver based on code-aided channel estimation in comparison to receivers using synchronized detection with a solely pilot based channel estimation. Furthermore, we compare this approximate upper bound with a lower bound on the achievable rate with joint processing of data and pilot symbols given in [1]. In addition, we show which part of the mutual information between the transmitter and the receiver cannot be exploited by the given receiver structure using synchronized detection in combination with iterative code-aided channel estimation.

BibTEX Reference Entry 

	author = {Meik D{\"o}rpinghaus and Adrian Ispas and Heinrich Meyr},
	title = "Achievable Rate with Receivers using Iterative Channel Estimation in Stationary Fading Channels",
	pages = "517-521",
	booktitle = "International Symposium on Wireless Communication Systems (ISWCS) 2011",
	address = {Aachen, Germany},
	doi = 10.1109/ISWCS.2011.6125412,
	month = Nov,
	year = 2011,
	hsb = hsb999910117187,


 Download paper  Download bibtex-file

© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.