By Topic

MAP channel estimation for Alamouti-based cooperative networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kammoun, I. ; LETI Dept., Ecole Nat. d''Ing. de Sfax, Sfax ; Siala, M.

In this paper, we consider a cooperative network with one source, one destination and two relays to bring cooperative diversity. We assume the link between the source and the destination is so bad that we do not consider it. We propose a decode-and-forward (DAF) strategy based on the Alamouti space-time (ST) code. The two relays must recover the transmitted sequence and forward it to the destination. We consider fast time varying channels between the cooperative users and the destination and our objective is to estimate these two channels in order to recover the information sequence at the destination. We propose a data-aided decision-directed Maximum A Posteriori (MAP) iterative channel estimation algorithm. It can profit from an optimum initialization by means of the MAP data-aided channel estimation. Besides, we adapt this iterative receiver to the case where the destination is equipped with two receive antennas to bring more diversity. The validity of the proposed algorithms is highlighted by simulation results.

Published in:

Personal, Indoor and Mobile Radio Communications, 2008. PIMRC 2008. IEEE 19th International Symposium on

Date of Conference:

15-18 Sept. 2008