# A novel pre-processing and adaptive statistical threshold for sphere detection in MIMO systems

- Haiyan Cao
^{1, 2}, - Jun Li
^{3}Email author, - Xin Fang
^{1}and - Xiumin Wang
^{3}

**2013**:275

https://doi.org/10.1186/1687-1499-2013-275

© Cao et al.; licensee Springer. 2013

**Received: **10 May 2012

**Accepted: **12 November 2013

**Published: **5 December 2013

## Abstract

In this paper, an efficient sphere detection (SD) scheme for multiple-input multiple-output (MIMO) systems is presented. The proposed SD scheme can substantially reduce computational complexity by introducing a pre-processing scheme and an adaptive threshold. In particular, our proposed pre-processing scheme is based on an iterative successive interference cancelation (SIC). The proposed adaptive threshold is used to judge whether a traversed path is correct or not and obtained by analyzing the distributions of the correct and erroneous estimates which have the minimum error pattern among all the SD searching paths. Simulation results show that our proposed scheme offers a substantial complexity reduction in terms of the number of visited nodes while keeping a significantly small performance degradation compared to conventional approaches.

## 1 Introduction

The maximum likelihood (ML) detection is considered as an optimal solution for achieving the minimum error probability of multiple-input multiple-output (MIMO) systems. However, the ML detection, also a well-known non-deterministic polynomial-time (NP)-complete problem, comes at an expense of computational complexity. To overcome this shortcoming, several suboptimal detection algorithms, such as zero forcing (ZF), minimum mean-square error (MMSE), and successive interference cancelation (SIC), have been proposed. Although these algorithms have lower complexity than ML, the achievable performance is far below the performance of the ML receiver.

Sphere detection (SD) algorithm is a tree search strategy that can achieve a similar performance to that of ML and is widely considered to be the most promising approach for MIMO detection. It has polynomial expected complexity for problems with moderate size and can be efficiently used for moderate signal-to-noise ratios (SNRs) [1, 2]. However, the expected complexity is exponential in the number of antennas and constellation size for fixed SNRs [2], and it still requires a large amount of computations compared to MMSE- and ZF-based algorithms, especially for high numbers of antennas and large constellation sizes. Hence, many efforts have been made to modify the SD algorithm to further reduce the computational complexity such as the Schnorr-Euchner (SE) [3] strategy, channel matrix pre-processing (ordering scheme) [4–6], modification of the lattice representation [7], probabilistic tree pruning strategy [8], and k-best algorithm [9]. All the schemes can improve SD efficiency to some degrees while still maintaining a large amount of computations.

Motivated by all of the above, in this paper, we propose an efficient ordering scheme and adaptive threshold to decrease SD complexity while keeping the system performance satisfactory. An ordering scheme based on SIC which the authors call sorted SIC (SSIC) ordering is proposed. Then, an adaptive threshold which can be seen as the extension of the threshold used in fixed-complexity SD (FSD) [10] is developed. Simulation results show that the proposed scheme combining SSIC ordering with adaptive threshold results in almost minimum complexity (in terms of the number of visited nodes) compared to other existing approaches with neglected performance degradation.

Throughout this paper, the following notations are adopted. Bold uppercase and lowercase letters stand for matrices and vectors, respectively. (●)^{
T
} and (●)^{−1} describe the transpose and inverse of a matrix, respectively. Furthermore, ∥●∥ and |●| denote the norm and absolute operator, respectively, and *E* [ ●] is the expectation operator. In addition, (●)_{
i
} means the *i* th row for a matrix or the *i* th element of a vector.

## 2 System model and sphere detection

*N*transmit and

*M*receive antennas where

*M*≥

*N*. The input-output relationship can be expressed as

*N*-dimensional transmitted complex vector whose entries

*s*

_{ i },

*i*=1,2,…,

*N*, are drawn from some quadrature amplitude modulation (QAM) constellation with the real and imaginary parts being integers; $\mathbf{y}=\left({y}_{1},{y}_{2},\dots ,{y}_{M}\right)\in {\mathcal{C}}^{M}$ is an

*M*-dimensional received complex vector; $\mathbf{H}\in {\mathcal{C}}^{M\times N}$ denotes the

*M*×

*N*MIMO channel matrix; and $\mathbf{w}\in {\mathcal{C}}^{N}$ is the additive white Gaussian noise (AWGN) vector. The matrix

**H**is defined by

**H**= [

*h*

_{ i j }] for 1≤

*i*≤

*M*and 1≤

*j*≤

*N*, where

*h*

_{ i j }, the

*i*th row and

*j*th column entry of

**H**, is assumed to be an independent and identically distributed (i.i.d.) circular symmetric complex Gaussian random variable with 0 mean and 1 variance. The tuples of

*N*-dimensional Gaussian noise vector

**w**are i.i.d. circular symmetric complex Gaussian random variables with 0 mean and

*σ*

^{2}variance. Herein, the SNR at the receiver is defined as

*m*=2

*M*and

*n*=2

*N*. As such, (1) can be rewritten as

*I*(●) denote the real and imaginary parts of complex numbers, respectively. Since all the complex form of (1) can be written as (3), we assume that (1) is a real-valued model without loss of generality in the following. Suppose perfect channel knowledge is available at the receiver, the ML detection problem can be formulated as

*A*is the signal constellation set, e.g., $\mathcal{A}=\{-3,-1,1,3\}$ for 16QAM. For a general

**H**, this problem is known to be NP-hard. Sphere decoding solves (4) by searching only over those points that satisfy a constraint of the form

*d*

_{0}instead of searching all lattice points. By applying QR decomposition to

**H**, (5) can be written as

**R**is an

*n*×

*n*upper triangular matrix,

**Q**= [

**Q**

_{ 1 }

**Q**

_{ 2 }] is an

*m*×

*m*orthogonal matrix, and

**Q**

_{ 1 }and

**Q**

_{ 2 }represent the first

*n*and last

*m*−

*n*orthonormal columns of

**Q**, respectively. Suppose radius

*d*

_{0}is sufficiently large so that the ML solution lies in the hypersphere, and let ${d}^{2}={d}_{0}^{2}-{\u2225{\mathbf{Q}}_{\mathbf{2}}^{\mathbf{T}}\mathbf{y}\u2225}^{2}$ and $\mathbf{z}={\mathbf{Q}}_{1}^{T}\mathbf{y}=\mathbf{Rs}+{\mathbf{Q}}_{1}^{T}\mathbf{w}$; thus, sphere decoding solves (4) by

*R*

_{ i j }denotes the

*i*th row and

*j*th column tuple of matrix

**R**. From (7), we can see that

**s**

_{ML}can be solved recursively by following a similar fashion to that in the SIC technique. Specifically, we use a constrained tree search through multiple levels, starting from ${\u015d}_{n}$ down to ${\u015d}_{1}$, as shown in Figure 1.

## 3 Proposed scheme

In this section, we propose the SSIC ordering scheme to significantly improve the ML performance using the SD algorithm. In addition, we further reduce the SD complexity by developing a new adaptive threshold to judge whether an estimate is correct or not, attempting to output the good estimate as early as possible.

### 3.1 Proposed pre-processing

**H**

^{ † }=(

**H**

^{ T }

**H**)

^{−1}

**H**

^{ T }is the pseudo-inverse of channel matrix

**H**, and $\mathbf{v}={\mathbf{Q}}_{1}^{T}\mathbf{w}$ is an i.i.d. noise vector with the same distribution as

**w**. Therefore, the

*i*th tuple of ZF solutions is given by

**H**

^{ † })

_{ i }denotes the

*i*th row of matrix

**H**

^{ † }. It is shown that each component of the ZF solution vector is detected out of various noise levels which is modified by (

**H**

^{ † })

_{ i }. Motivated by the observation, we define the signal reliability:

*i*=0,1,…,

*n*−1):

- 1.
Set

**H**_{0}=**H**,**z**_{0}=**z**, and $\mathcal{N}=\left\{1,2,\dots ,n\right\}$. - 2.
Calculate the matrix ${\mathbf{H}}_{i}^{\u2020}$, where ${\mathbf{H}}_{i}^{\u2020}$ is the pseudo-inverse of the

*i*th iteration channel matrix**H**_{ i }. - 3.
Calculate the ZF solution vector ${\mathbf{s}}_{i}^{\mathit{\text{zf}}}={\left[{\left({s}_{i}^{\mathit{\text{zf}}}\right)}_{1},{\left({s}_{i}^{\mathit{\text{zf}}}\right)}_{2},\dots ,{\left({s}_{i}^{\mathit{\text{zf}}}\right)}_{n-i}\right]}^{T}={\mathbf{H}}_{i}^{\u2020}{\mathbf{z}}_{i}$, where

**z**_{ i }is the*i*th iteration received signal, and for each element ${\left({s}_{i}^{\mathit{\text{zf}}}\right)}_{j}$ of ${\mathbf{s}}_{i}^{\mathit{\text{zf}}}$, find ${s}_{j}^{\left(1\right)}\phantom{\rule{0.3em}{0ex}}\in \phantom{\rule{0.3em}{0ex}}\mathcal{A}$ such that $\u2225{s}_{j}^{\left(1\right)}-{\left({s}_{i}^{\mathit{\text{zf}}}\right)}_{j}\u2225\phantom{\rule{0.3em}{0ex}}\le \phantom{\rule{0.3em}{0ex}}\u2225{s}_{j}^{\left(\ell \right)}-{\left({s}_{i}^{\mathit{\text{zf}}}\right)}_{j}\u2225$ holds for any*ℓ*=2,3,…,*L*, where ${s}_{j}^{\left(\ell \right)}\in \mathcal{A}$ and*L*is the constellation size. - 4.
For each element ${\left({s}_{i}^{\mathit{\text{zf}}}\right)}_{j}$, find out ${\widehat{k}}_{i}=\underset{j=1,\dots ,n-i}{arg\; max}\phantom{\rule{0.3em}{0ex}}\frac{\u2225{s}_{j}^{\left(1\right)}-{\left({s}_{i}^{\mathit{\text{zf}}}\right)}_{j}\u2225}{\u2225{\left({\mathbf{H}}_{i}^{\u2020}\right)}_{j}\u2225}$, and ${k}_{i}=\mathcal{N}\left({\widehat{k}}_{i}\right)$, the ${\widehat{k}}_{i}$th element in set , is the corresponding column index of channel matrix

**H**, and let $\mathcal{N}=\mathcal{N}\setminus \left\{{\widehat{k}}_{i}\right\}$, where ∖ denotes the set subtraction. - 5.
Cross the ${\widehat{k}}_{i}$th column out of

**H**_{ i }to be**H**_{i+1}, let ${\mathbf{z}}_{i+1}={\mathbf{z}}_{i}-{\mathbf{h}}_{{k}_{i}}{s}_{{k}_{i}}^{\left(1\right)}$,*i*=*i*+1, and repeat steps 2 to 5 until*i*=*n*−1, where ${\mathbf{h}}_{{k}_{i}},i=0,1,\dots ,n-1$ is*k*_{ i }th column of**H**. - 6.
The columns of the channel matrix are reordered as $\mathbf{H}=\left[{\mathbf{h}}_{{k}_{n-1}},{\mathbf{h}}_{{k}_{n-2}},\dots ,{\mathbf{h}}_{{k}_{1}},{\mathbf{h}}_{{k}_{0}}\right]$.

### 3.2 Proposed adaptive threshold

*C*=∥

**v**∥

^{2}is a central chi-square-distributed random variable with

*n*degrees of freedom denoted as ${\chi}_{n}^{2}$. In contrast, the metric for the case of $\widehat{\mathbf{s}}\ne \mathbf{s}$ is the non-central chi-square-distributed random variable with

*n*degrees of freedom. Given a certain error pattern, if the Hamming distance between signal vector

**s**and estimated vector $\widehat{\mathbf{s}}$ is

*K*, then

**s**and $\widehat{\mathbf{s}}$ differ at

*K*places denoted as

*i*

_{1},

*i*

_{2},…,

*i*

_{ K }. In this case, the metric

*C*now turns to be

*C*

^{′}given by

*i*

_{ k }th column of

**R**. Obviously, $\sum _{k=1}^{K}{\mathbf{r}}_{{i}_{k}}\left({s}_{{i}_{k}}-{\u015d}_{{i}_{k}}\right)+\mathbf{v}$ is a Gaussian vector with the mean vector $\sum _{k=1}^{K}{\mathbf{r}}_{{i}_{k}}\left({s}_{{i}_{k}}-{\u015d}_{{i}_{k}}\right)$ and the same covariance matrix as

**v**. Thus,

*C*

^{′}is the non-central chi-square-distributed random variable with

*n*degrees of freedom denoted as

*χ*

*n*,

*γ*

^{2}2, where the non-central parameter

*γ*

^{2}is shown as

*χ*

*n*,

*γ*

^{2}2 can be set as the optimum threshold whether an estimate is correct or not. Among all the error patterns, the minimum one is that there exists one path which has Hamming distance 1 to the correct path, say, they differ at the site, and the corresponding column of

**R**exactly has the minimum norm. Therefore, we select the optimum threshold to be the intersection point for PDFs of ${\chi}_{n}^{2}$ and

*χ*

*n*,

*γ*

^{2}2, which gives the minimum non-central parameter as

*α*is a constant coefficient depending on the degrees of freedom, which can be calculated offline by numeric computation since the intersections for PDFs of ${\chi}_{n}^{2}$ and

*χ*

*n*,

*γ*

^{2}2 almost lie on a line if the non-central parameters are not very large, as shown in Figure 2 which indicates the PDF for central and non-central

*χ*

^{2}of 8 degrees of freedom. In this way,

*α*can be obtained, for instance, as 0.3465, 0.366, and 0.4082 for the case where the degrees of freedom are 4, 8, and 16, respectively. The proposed threshold based on minimum error pattern (MEP-T) is applied when the SD searching reaches level

*n*(leaf nodes). Based on our SSIC ordering scheme and proposed threshold, our SD search process can be described as follows:

- 1.
Initialize radius

*d*→*∞*.

- 2.
Perform SSIC precessing algorithm to reorder the columns of channel matrix

**H**. - 3.
Apply QR decomposition to the reordered channel matrix, i.e.,

**H**=**Q****R**. - 4.
Calculate threshold

*T*by (15). - 5.
Normally run a depth-first constrained tree search through

*n*levels. - 6.
Compute the whole accumulated metric

*C*through*n*levels by (11), and compare*C*with threshold*T*. Terminate the SD decoding process and output the solution if*C*≤*T*holds. - 7.
Otherwise, compare

*C*with radius*d*. If*C*≤*d*, update radius*d*as*d*=*C*and repeat steps from 5 to 7 until a path, which is the first one such that*C*≤*T*holds or has the minimum accumulated metric*C*, is found.

## 4 Simulation results

Intuitively, the reason why it has such a low complexity in average can be investigated through the behavior of the SSIC ordering and MEP-T threshold. The SSIC ordering leads to the case that the lattice point which has the most possible to be the solution has the higher privilege to be searched. Moreover, the threshold is set properly and can be considered that it constrains a hypersphere area in which all the lattice points (corresponding to the full path in the searching tree) are the ‘ML solution.’ Since the real ML solution has the minimum metric, it certainly lies in the area. Once any one lattice point in the area has been searched, the searching process terminates. As the SNR increases, the number of lattice points in the area goes down, and the probability of obtaining the real ML solution goes larger and larger. That is why the complexity is low while having a negligible performance loss at the high-SNR region under our scheme. At the low-SNR region, the area contains more lattice points, which leads to an incorrect estimate with a larger probability. However, the errors given in this way do not affect the performance significantly because even the real ML solution yielded by the exhaustive search at the low-SNR region also gives the wrong estimate. Therefore, in our SSIC with MEP-T scheme, the correct and incorrect estimates are well distinguished at the high-SNR region, and the complexity reduction is preferred at the low-SNR region instead of improving a little performance while increasing enormous complexity.

## 5 Conclusions

In this paper, we propose an efficient SD algorithm by jointly combining the SSIC ordering scheme and the adaptive threshold MEP-T. In particular, the SSIC ordering scheme is based on the iterative SIC and MEP-T is obtained by analyzing the PDFs of the correct and erroneous estimates, which have the minimum error pattern among all the SD searching paths. Simulation results show that our SSIC ordering scheme is more efficient than BSQR, GB, and V-BLAST by reducing the computational complexity in terms of the number of visited nodes. More importantly, combining SSIC ordering with MEP-T can further reduce the complexity and offer almost a fixed average complexity at an expense of an unnoticeably small performance degradation compared to conventional methods.

## Declarations

### Acknowledgements

The authors would like to thank the Associate Editor and the reviewers for their comments and suggestions which help improve the quality and clarity of this paper. This work was supported by Zhejiang Natural Science Foundation (Y1090935) and National Natural Science Foundation of China (61379027).

## Authors’ Affiliations

## References

- Jalden J, Ottersten B: An exponential lower bound on the expected complexity of sphere decoding. In
*Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing*. Montreal: IEEE; 2004:393-396.Google Scholar - Jalden J, Ottersten B: On the complexity of sphere decoding in digital communications.
*IEEE Trans. Sig. Proc*2005, 53(4):1474-1484.MathSciNetView ArticleGoogle Scholar - Schnorr CP, Euchner M: Lattice basis reduction: improved practical algorithms and solving subset sum problems.
*Math. Program*1994, 66(2):181-191.MathSciNetView ArticleGoogle Scholar - Wolniansky PW, Foschini GJ, Golden GD, Valenzuela RA: V-BLAST: an architecture for realizing very high data-rates over the rich-scattering wireless channel. In
*Proceedings of the URSI International Symposium on Signals, Systems, and Electronics*. Piscataway: IEEE; 1998:295-300.Google Scholar - Dai Y, Yan Z: Memory-constrained tree search detection and new ordering schemes.
*IEEE J. Sel. Topic Sig. Process*2009, 3(6):1026-1037.View ArticleGoogle Scholar - Trujillo R, Garcia VM, Vidal A, Roger S, Gonzalez A: Gradient-based ordering for MIMO decoding. In
*Proceedings of the IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)*. Ajman: IEEE; 2009:5-8.Google Scholar - Azzam L, Ayanoglu E: Reduced complexity sphere decoding via a reordered lattice representation.
*IEEE Trans. Commun*2009, 57(9):2564-2569.View ArticleGoogle Scholar - Lei S, Xiong C, Zhang X, Yang D: Adaptive control of surviving branches for fixed-complexity sphere decoder. In
*Proceedings of the IEEE 71st Vehicular Technology Conference*. Taipei: IEEE; 2010:1-5.Google Scholar - Wu X, Dai Y, Yan Z, Wang Y: Improving the reliability of the k-best algorithm for MIMO detection with ordering. In
*Proceedings of the Wireless and Optical Communications Conference (WOCC)*. Shanghai: IEEE; 2010:1-5.Google Scholar - Wu X, Thompson J: Accelerated sphere decoding for multiple-input multiple-output systems using an adaptive statistical threshold.
*IET Signal Process*2009, 3(6):433-444. 10.1049/iet-spr.2009.0028MathSciNetView ArticleGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.