MIMO Equalization of 16-QAM Signal Blocks using an FFT-based Alphabet-Matched CMA

被引：0

作者：

Taiwo, Peter O. ^{[1
]}

Cole-Rhodes, Arlene ^{[1
]}

机构：

[1] Morgan State Univ, Elect & Comp Engn Dept, Baltimore, MD 21251 USA

来源：

2017 51ST ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS) | 2017年

关键词：

Blind equalization; Constant modulus algorithm; Alphabet matched algorithm; FFT; Channel estimation; MIMO Communication system;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this work we investigate the blind equalization of signal blocks of data, which have been transmitted over a multiple-input/multiple-output channel using 16-QAM modulation. We apply the Fast Fourier Transform (FFT) in order to improve the efficiency of the blind equalizer update. Our equalizer is based on a cost function, which is specified as the sum of the constant modulus algorithm (CMA) and the alphabet-matched algorithm (AMA). The equalization is done using a block processing multistage approach as was introduced in [3], but with an FFT implementation. In this work, a 3-input/7-output MIMO communication system is considered, and the performance of the MIMO equalizer is analyzed using Monte Carlo simulations. Performance is measured based on the average symbol error rate (SER) and the total number of equalized cases. In addition, initial comparative results are provided for a fixed number of transmit antennas, but with varying numbers of receive antennas.

引用

页数：6