Exploiting a priori information for iterative channel estimation in block-fading amplify-and-forward cooperative networks

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In an amplify-and-forward cooperative network, a closed-form expression of the a priori distribution of the complex-valued gain of the global relay channel is intractable, so that a priori information is often not exploited for estimating this gain. Here, we present two iterative channel gain and noise variance estimation algorithms that make use of a priori channel information and exploit the presence of not only pilot symbols but also unknown data symbols. These algorithms are approximations of maximum a posteriori estimation and linear minimum mean-square error estimation, respectively. A substantially reduced frame error rate is achieved as compared to the case where only pilot symbols are used in the estimation.

Cite

CITATION STYLE

APA

Aerts, N., Avram, I., & Moeneclaey, M. (2014). Exploiting a priori information for iterative channel estimation in block-fading amplify-and-forward cooperative networks. Eurasip Journal on Wireless Communications and Networking, 2014(1). https://doi.org/10.1186/1687-1499-2014-222

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free