Blind Source Separation and Equalization for MIMO-MC-CDMA communication systems

• Main Authors: Yan-Jia Cheng, 程彥嘉
• Other Authors: Fang-Buau Ueng
• Format: Others
• Language: en_US
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/88298815714733240441

碩士 === 國立中興大學 === 電機工程學系所 === 98 === The Godard or constant modulus algorithm (CMA) [44] is perhaps the best known and the most popular scheme for adaptive blind source separation and equalization. First analyze reveals that the MIMO-CMA equalizer is able to recover one of the input signals, remove the inter-symbol interference (ISI), and suppress the inter-source interference. Furthermore, for the MIMO finite impulse response (FIR) systems satisfying certain conditions, the MIMO-CMA FIR equalizers are able to perfectly recover one of the system inputs regardless of the initial settings. Then propose a family of CMA for adaptive blind source separation and equalization for Multi-Carrier Code Division Multiple Access (MC-CDMA MIMO) systems. Theoretical analysis proves that the families of constant modulus algorithms are able to recover all system inputs simultaneously regardless of the initial settings. The Family of CMA mentioned has these of Sato、modify CMA-based algorithm、CMA-based algorithm and modify constant modulus algorithm (MCMA), where the CMA-based algorithm has already been proposed by SHI Kun, and ZHANG Xudong [33], it has improved the CMA, that unknown transmitter signal of modulation, and the modify CMA-based algorithm improve the unstability of CMA-based algorithm. Finally, computer simulation examples are presented to confirm analysis and illustrate the effectiveness of A Family of Constant Modulus Algorithms for Blind Source Separation and Equalization in MC-CDMA MIMO Systems.