Blind Space-time Decoding Algorithms by Kurtosis Maximization for Synchronous STC-MC-CDMA Systems

碩士 === 國立清華大學 === 通訊工程研究所 === 93 === Space-time coding schemes using multiple transmit antennas have proven efficient for transmit diversity in wireless communications. However, these schemes require channel state information (estimated through pilot signals) for the conventional space-time block de...

Full description

Bibliographic Details
Main Authors: Chia-Hao Kuo, 郭家豪
Other Authors: Chong-Yung Chi
Format: Others
Language:en_US
Published: 2005
Online Access:http://ndltd.ncl.edu.tw/handle/65229717426885621356
Description
Summary:碩士 === 國立清華大學 === 通訊工程研究所 === 93 === Space-time coding schemes using multiple transmit antennas have proven efficient for transmit diversity in wireless communications. However, these schemes require channel state information (estimated through pilot signals) for the conventional space-time block decoding algorithms (such as maximum ratio combining (MRC) and minimum mean square error (MMSE)) at the receiver. Recently, blind subspace based channel estimation algorithms (without need of pilot signals) were also considered to provide the channel state information for space-time block decoding of a multicarrier CDMA (MC-CDMA) system at the receiver. In this thesis, two blind space-time de-coding (BSTD) algorithms (algorithm 1 and algorithm 2), which do not require channel state information for space-time decoding at the receiver, are proposed for the synchronous MC-CDMA system with multiple transmit and receive antennas used. The proposed algorithm 1 (or algorithm 2) is an iterative algorithm using Chi and Chen computationally efficient fast kurtosis maximization algorithm with su-per-exponential convergence rate. Some simulation results are presented to support the efficacy of the proposed BSTD algorithms. Finally, some conclusions are drawn.