Soft-input soft-output single tree-search sphere decoding

Authors

Christoph Studer and Helmut Bölcskei

Reference

IEEE Transactions on Information Theory, Vol. 56, No. 10, pp. 4827-4842, Oct. 2010

DOI: 10.1109/TIT.2010.2059730

[BibTeX, LaTeX, and HTML Reference]

Abstract

Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for practical receiver implementations, in particular in the context of multiple-input multiple-output (MIMO) wireless communication systems. In this paper, we present a low-complexity SISO sphere-decoding algorithm, based on the single tree-search paradigm proposed originally for soft-output MIMO detection in Studer, et al., IEEE J-SAC, 2008. The new algorithm incorporates clipping of the extrinsic log-likelihood ratios (LLRs) into the tree-search, which results in significant complexity savings and allows to cover a large performance/complexity tradeoff region by adjusting a single parameter. Furthermore, we propose a new method for correcting approximate LLRs---resulting from sub-optimal detectors---which (often significantly) improves detection performance at low additional computational complexity.

Keywords

Multiple-input multiple-output (MIMO) communication, soft-input soft-output detection, sphere decoding, iterative MIMO decoding


A software package containing the code of the SISO STS-SD algorithm as well as a complete Monte-Carlo MIMO-OFDM simulation environment can be downloaded here.


Download this document:

 

Copyright Notice: © 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.