Channel and delay estimation for base-station-based cooperative communications in frequency flat-fading channels

Authors

  • Hongjun Xu School of Electrical, Electronic and Computer Engineering, University of KwaZulu-Natal - Howard College campus
  • Laneil Padayachee School of Electrical, Electronic and Computer Engineering, University of KwaZulu-Natal - Howard College campus

Keywords:

asynchronous cooperative communication, channel estimation, cyclic prefx, distributed space-time coding, pilot symbol design

Abstract

Base-station - based cooperative communication is an asynchronous cooperative communication system. The challenge therein is to estimate the relative delay between the transmitters in the system. A channel and delay estimation algorithm based on the distributed Alamouti scheme has been previously discussed for the asynchronous cooperative system. The algorithm only makes accommodation for positive delay, that is, when data from Transmitter one always arrives at the receiver before data from Transmitter two. In reality, the data from Transmitter one does not always arrive at the receiver before data from Transmitter two in the asynchronous cooperative system, because of the constantly changing mobile environment in the system. This paper extends the algorithm to accommodate both positive and negative delays, which is when the data from Transmitter one arrives at the receiver before or after data from Transmitter two, in a Rayleigh block fat-fading channel. Simulation results show that the Cram ér - Rao lower bound for channel and delay estimation is achieved for different delay values. The symbol error rate performance is also achievable compared to the channel and the delay is known at the receiver.

Published

2010-04-23

Issue

Section

Research Articles

How to Cite

Xu, H., & Padayachee, L. (2010). Channel and delay estimation for base-station-based cooperative communications in frequency flat-fading channels. South African Journal of Science, 106(3/4), 6 pages. https://sajs.co.za/article/view/10165
Views
  • Abstract 116
  • PDF (549 KB) 92
  • HTML 125
  • XML 67
  • Eqn 1 & 2 3
  • Eqn 3 & 4 3
  • Eqn 5 3
  • Eqn 6, 7 & 8 3
  • Eqn 9 3
  • Eqn 10 & 11 3
  • Eqn 12 & 13 3
  • Eqn 14 & 15 3
  • Eqn 16 3
  • Eqn 17 & 18 3
  • Eqn 19 3
  • Eqn 20 & 21 3
  • Eqn 22, 23 & 24 3
  • Eqn: 25,26,27,28,29,30 & 31 3
  • Eqn 32 3
  • Eqn 33 & 34 3
  • Eqn 35 & 36 3
  • Eqn 37 3
  • Eqn 38 3
  • Figure 1 3
  • Figure 2 3
  • Figure 3 & 4 3
  • Figure 5 & 6 3
  • Figure 7 & 8 3
  • Figure 9 & 10 3