Journal of South China University of Technology (Natural Science Edition) ›› 2015, Vol. 43 ›› Issue (1): 47-52.doi: 10.3969/j.issn.1000-565X.2015.01.008

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

Iterative Dimensionality-Reduction Parallel Detection Algorithm for MIMO System

Zhang Qi Ge Jian-hua Li Jing   

  1. State Key Laboratory of Integrated Services Networks, Xidian University
  • Received:2014-04-25 Revised:2014-07-14 Online:2015-01-25 Published:2014-12-01
  • Contact: 张琦(1978-),男,博士生,主要从事无线 MIMO 系统研究. E-mail:ahqicn@163.com
  • About author:张琦(1978-),男,博士生,主要从事无线 MIMO 系统研究.
  • Supported by:
    Supported by the National Program on Key Basic Research Project of China (2012CB316100),the National Na-tural Science Foundation of China (61001207,61101144,61101145) and the Programme of Introducing Talents of Discipline to Uni-versities (B08038)

Abstract: An improved iterative dimensionality-reduction parallel detection algorithm is proposed to mitigate the effects of the low diversity gain of the first detective sub-streams and the error propagation in traditional Multiple Input Multiple Output (MIMO) detection algorithm.In each iteration of the algorithm, the first substream is found by exhaustive search while other sub-streams are detected in parallel through ordered successive interference cancellation (OSIC) , and only the estimates of the first sub-stream with the highest diversity order can be obtained at the end of each iteration.Furthermore, between two different iterations, interference cancellation is employed to reduce the dimension of sub-streams.Simulated results indicate that, only with marginal complexity cost, the proposed algorithm helps obtain BER (Bit Error Rate) performance approaching maximum likelihood detection algorithm.Particularly, in a 4×4 QPSK modulation MIMO system, the performance gain of the proposed algorithm over OSIC is 9.3dB at a BER of 10-3.

Key words: MIMO systems, error propagation, parallel, dimensional reduction

CLC Number: