On perfect channel identifiability of semiblind ML detection of orthogonal space-time block coded OFDM

  • Authors:
  • Tsung-Hui Chang;Wing-Kin Ma; Chuan-Yuan Huang;Chong-Yung Chi

  • Affiliations:
  • Institute of Commun. Eng.&Dept. of Elec. Eng., National Tsing Hua University, Hsinchu, Taiwan 30013;Dept. of Electronic Eng., The Chinese University of Hong Kong, Shatin, N.T., Hong Kong;Institute of Commun. Eng.&Dept. of Elec. Eng., National Tsing Hua University, Hsinchu, Taiwan 30013;Institute of Commun. Eng.&Dept. of Elec. Eng., National Tsing Hua University, Hsinchu, Taiwan 30013

  • Venue:
  • ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper considers maximum-likelihood (ML) detection of orthogonal space-time block coded OFDM (OSTBC-OFDM) systems without channel state information. Our previous work has shown an interesting identifiability result, that the whole time-domain channel can be uniquely identified by only having one subchannel to transmit pilots. However, this identifiability is in a probability-one sense, under some mild assumptions on the channel statistics. In this paper we establish a “perfect” channel identifiability (PCI) condition under which the channel is always uniquely identifiable. It is shown that PCI can be achieved by judiciously applying the so-called non-intersecting subspace OSTBCs. The resultant PCI achieving scheme has its number of pilots larger than that used in the previous probability-one identifiability achieving scheme, but smaller than that required in conventional pilot-aided channel estimation. Simulation results are presented to show that the proposed scheme can provide a better performance than the other schemes.