Cramér-Rao Bounds of Unbiased Channel Estimation for Amplify-and-Forward Relay Networks

碩士 === 臺灣大學 === 電信工程學研究所 === 98 === Cooperative communication has gained increasing popularity recently since spatial diversity can be provided so as to mitigate fading over wireless transmission without raising hardware complexity of mobile devices. The main concept of cooperative communication is...

Full description

Bibliographic Details
Main Authors: Po-Yu Li, 黎博幼
Other Authors: 鐘嘉德
Format: Others
Language:zh-TW
Published: 2010
Online Access:http://ndltd.ncl.edu.tw/handle/72274200139111267727
Description
Summary:碩士 === 臺灣大學 === 電信工程學研究所 === 98 === Cooperative communication has gained increasing popularity recently since spatial diversity can be provided so as to mitigate fading over wireless transmission without raising hardware complexity of mobile devices. The main concept of cooperative communication is that idle mobile devices, termed as relay nodes, can be utilized to send data for the source node. The relay networks form a virtual antenna array in a distributed manner. In the literature, however, the performance analysis of channel estimation for relay networks has not been well addressed yet. In this thesis, the performance of channel estimation for amplify-and-forward (AF) relay networks will be analyzed in terms of Cramér-Rao bound (CRB), which is the renowned lower bound for estimation. First, we will introduce the relaying protocols and corresponding signal models. Then we will derive the CRB of AF relay networks for unbiased centralized channel estimation, and for unbiased distributed channel estimation, respectively. Finally, the influence of relay parameters on the derived CRB will be discussed in detail.