A Study on Complexity Reduction for Space-Time Block Codes Decoder in MIMO OFDM systems

  • Pham, Van-Su (School of Engineering, Information and Communications University) ;
  • Le, Minh-Tuan (School of Engineering, Information and Communications University) ;
  • Mai, Linh (School of Engineering, Information and Communications University) ;
  • Yoon, Gi-Wan (School of Engineering, Information and Communications University)
  • Published : 2005.05.27

Abstract

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is defined by the intersection of an approximate polygon of searching circle and disk of lattice constellation. Therefore, the proposed scheme can reduce the searching boundary and it can avoid missing searching points as well. The performance of the proposed scheme, which is verified by computer simulations, consolidates our scheme.

Keywords