The Cramer-Rao Bound for channel estimation in block fading Amplify-and-Forward relaying networks

Author

Aerts, Nico ; Avram, Iancu ; Moeneclaey, Marc

Author_Institution

Dept. of Telecommun. & Inf. Process., Ghent Univ., Ghent, Belgium

fYear

2010

fDate

17-20 Oct. 2010

Firstpage

12

Lastpage

16

Abstract

In this paper, we express the Cramer-Rao Bound (CRB) for channel coefficient and noise variance estimation at the destination of an Amplify-and- Forward (AF) based cooperative system, in terms of the a posteriori expectation of the codewords. An algorithm based on factor graphs can be applied in order to calculate this expectation. As the computation of the CRB is rather intensive, the modified CRB (MCRB), which is a looser bound, is derived in closed form. It can be shown that the MCRB coincides with the CRB in the high signal-to-noise ratio (SNR) limit and to that end the CRB/MCRB ratio is simulated in case of uncoded and convolutional encoded transmission.

Keywords

amplify and forward communication; channel estimation; convolutional codes; fading channels; maximum likelihood estimation; Cramer-Rao bound; amplify-and-forward relaying networks; channel estimation; convolutional encoded transmission; factor graphs; modified CRB; noise variance estimation; posteriori expectation; signal-to-noise ratio; Channel estimation; Convolutional codes; Erbium; Estimation; Relays; Signal to noise ratio; Amplify-and-Forward; Cramer-Rao Bound; cooperative communication; modified CRB;

fLanguage

English

Publisher

ieee

Conference_Titel

Spread Spectrum Techniques and Applications (ISITA), 2010 IEEE 11th International Symposium on

Conference_Location

Taichung

ISSN

1943-7439

Print_ISBN

978-1-4244-6013-7

Electronic_ISBN

1943-7439

Type

conf

DOI

10.1109/ISSSTA.2010.5651393

Filename

5651393