Training based channel estimation algorithms for dual hop MIMO OFDM relay systems

Andrew P. Millar, Stephan Weiss, Robert W. Stewart

Research output: Contribution to journalArticle

4 Citations (Scopus)
262 Downloads (Pure)

Abstract

In this paper we consider minimum mean square error (MMSE) training based channel estimation for two-hop multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) relaying systems. The channel estimation process is divided into two main phases. The relay-destination channel is estimated in the first phase and can be obtained using well known point-to-point MIMO OFDM estimation methods. In the second phase, the source-relay channel is estimated at the destination with the use of a known training sequence that is transmitted from the source and forwarded to the destination by a non-regenerative relay. To obtain an estimate of the source-relay channel, the source training sequence, relay precoder, and destination processor, require to be optimised. To solve this problem we derive an iterative algorithm that involves sequentially solving a number of convex optimisation problems to update the source, relay, and destination design variables. Since the iterative algorithm may be too computationally expensive for practical implementation we then derive simplified solutions that have reduced computational complexity. Simulation results demonstrate the effectiveness of the proposed algorithms.
Original languageEnglish
Pages (from-to)4711-4726
Number of pages16
JournalIEEE Transactions on Communications
Volume63
Issue number12
Early online date25 Sep 2015
DOIs
Publication statusPublished - 17 Dec 2015

Keywords

  • MIMO OFDM
  • relay networks
  • MMSE channel estimation
  • training sequence design
  • multiple input multiple output systems
  • orthogonal frequency division multiplexing

Fingerprint Dive into the research topics of 'Training based channel estimation algorithms for dual hop MIMO OFDM relay systems'. Together they form a unique fingerprint.

Cite this