Research Article | Open Access

Cao Haiyan, Li Jun, "A New Efficient Ordering Scheme for Sphere Detection", *Journal of Electrical and Computer Engineering*, vol. 2011, Article ID 821407, 4 pages, 2011. https://doi.org/10.1155/2011/821407

# A New Efficient Ordering Scheme for Sphere Detection

**Academic Editor:**George Tsoulos

#### Abstract

The decoding order has a deep impact in the complexity of sphere detection. A new ordering scheme for sphere detection is presented in this paper, which is based on SIC (serial interference canceling) and the gradient defined by the accumulated probability of the absolute difference between symbol element and the zero-forcing solution. The simulation results show that the proposed ordering scheme can achieve a significant complexity reduction, especially for high numbers of antennas and large constellation sizes in the low SNR region. Compared with sphere detection complexity under BSQR (balanced sorted QR) decomposition and GB (gradient-based) orderings at , the average number of visited nodes under our proposed ordering is reduced by almost 30% and 33% in 16QAM system and by almost 30% and 50% reduction in 16QAM system, respectively. For 64QAM system, almost 75% and 80% reduction at and more than 40% and 50% reduction at can be achieved, respectively.

#### 1. Introduction

Multiple-input multiple-output (MIMO) technology can linearly increase the channel capacity without requiring additional spectral resources. The maximum-likelihood (ML) detection is optimal for achieving the minimum error probability. However, it has an exponential complexity with respect to the order of the modulation and the number of transmit antennas. A few of suboptimal detection algorithms, such as zero forcing (ZF), minimum mean-squared (MMSE), and SIC (serial interference canceling) used in the vertical Bell Laboratories layered space-time (V-BLAST) [1], and so forth, have been proposed. Although these algorithms have low complexity, the achievable performance is bounded away from the performance of the optimum receiver.

Sphere detection (SD) algorithm is a tree search strategy that can achieve the exact ML performance while offering a polynomial computational complexity in the average case and is widely considered to be the most promising approach for MIMO detection. In fact, the sphere detector finds the closest lattice point to the received vector but limits the search only in those lattice points that fall within a hyper-sphere centered at the received vector, which results in a considerable reduction in complexity. However, for low SNR or high-order modulations, the complexity of the SD is still high. It has been shown that the computation complexity is highly sensitive to the order of the columns of channel matrix, which is dependent on both the channel matrix and the received signal, even when the efficient SE enumeration strategy [2] is used. Motivated by this observation, some channel matrix preprocessing approaches, such as V-BLAST ordering [1, 3], BSQRD (balanced sorted QR decomposition) ordering [4, 5], and GB (gradient-based) ordering [6], have been proposed to improve the SD efficiency.

In this paper, we modify GB ordering and combine it with SIC to propose a new efficient ordering scheme. The simulation results show that the proposed ordering scheme can achieve a significant complexity reduction, especially for high numbers of antennas and large constellation sizes in the low SNR regime.

The rest of the paper is organized as follows. Section 2 presents the system model and briefly reviews the SD algorithm. Section 3 describes our ordering scheme. Simulation results and discussions are provided in Section 4. Section 5 gives the conclusions.

#### 2. System Model and Sphere Detection

Consider an uncoded MIMO system with transmit and receive antennas where . Under the assumption of flat-fading channel, the received vector can be expressed as where denotes the transmitted vector of dimension , and we suppose that the entries of are selected from a complex-valued constellation, denotes the received vector of dimension , is the channel matrix, the elements of are assumed to be independent and identically distributed (i.i.d.) complex Gaussian variables with zero mean and 0.5 variance, and is the additive white Gaussian noise (AWGN) with zero mean and variance.

For simplicity, the complex-valued model (1) usually is transformed into a real-valued model, where the dimension is doubled such that , , where and denote the real and imaginary parts of complex numbers, respectively. Assume that perfect channel knowledge is given at the receiver, so the ML detection problem can be formulated as where and is real-valued signal constellation set, for example, for 16-QAM. SD only searches the lattice points inside the hypersphere centered at the received vector with radius instead of searching all lattice points, which can be written as Performing QR decomposition upon , we can get where is an upper triangular matrix, denotes Hermitian matrix transposition, and is an orthogonal matrix. and represent the first and last orthonormal columns of . Here we let and ; thus (4) is equivalent to a new inequality: owing to the upper triangular property of , the left-hand side of (6) can be expanded as We can get an interval of from the first term of (7) and also the intervals of , till by iteration. Therefore, can be solved recursively by SD algorithm, using a constrained tree search through levels, starting from down to , as shown in Figure 1.

The SD search process can be described as follows: (1) apply QR decomposition to such that , where is an orthogonal matrix and is upper triangular matrix; (2) perform a depth-first constrained tree search through levels starting from the last component of down to ; (3) update the radius when a point closer to the center is found inside the hypersphere; (4) continue to search with the new radius constraint until the closest point to the center is found. The detection efficiency can be improved by changing the order of columns of channel matrix instead of the original random order from down to .

#### 3. Ordering Schemes

The random decoding order is not the best decoding order, especially for low SNR or high-order modulation. Usually, rearranging the columns of the matrix properly to change the detection order can overcome it. The BSQR and V-BLAST orderings were devised to maximize the minimum of the diagonal elements of upper matrix , hoping that the width of the intervals will be reduced, and the search tree will be reduced as well. GB ordering is a simple but efficient scheme, in which the soft ZF solutions are taken as the references. However, the noises amplified by the pseudoinverse of channel matrix make the ZF solutions away from the correct one, especially at low SNR, and thus degrade the efficiency of ordering scheme. Since SD works in a similar way to the successive interference cancelation technique, we modify GB ordering and combine it with SIC to propose a new more efficient ordering scheme, which is described as follows for .(1)Set , and .(2)Calculate the ZF solution , where is the pseudoinverse of the *i*th iteration channel matrix , and, for each element of the solution , find the ordered set such that holds, where , , and is the size of real constellation set .(3)For each element of the solution , define and compute the gradient , where is the accumulated distribution function (CDF) of which is a Gaussian random variable with zero mean and variance, in which is the *j*th row of .(4)Compute , and is the corresponding column index of channel matrix . Then circularly shift to the left by 1 for the next iteration. (5)Let to cancel the interference, , and repeat (2)–(4) computation steps until .(6)The columns of channel matrix are reordered as .

#### 4. Simulation and Complexity Comparisons

In this section, we show the simulated comparisons of average number of visited nodes for , 16QAM, and 64QAM systems under five ordering schemes: no ordering (random ordering), V-BLAST ordering, BSQR decomposition ordering, GB ordering, and our proposed ordering. SE enumeration strategy is used in the course of sphere detection under all the ordering schemes. Figure 2 shows the comparison for 16QAM system; the average number of visited nodes under our proposed ordering is reduced by more than 35% and 38% at SNR = 0 dB and by almost 30% and 33% at SNR = 5 dB, respectively, compared with that under BSQR decomposition and GB orderings. In addition, the more reduction can be observed for 16QAM, almost 60% and 70% reduction at SNR = 0 dB and 30% and 50% reduction at SNR = 5 dB, respectively, as shown in Figure 3. Moreover, it is shown in Figure 4 that, more complexity reduction can be achieved for 64QAM system, almost 75% and 80% reduction at SNR = 0 dB and more than 40% and 50% reduction at SNR = 5 dB, respectively.

The simulation results clearly show that, under our ordering scheme, an extraordinary detection complexity reduction is realized especially at low and moderate SNRs and high modulation orders.

#### 5. Conclusions

A novel ordering scheme combining SIC with GB ordering is proposed to substantially improve the sphere detection efficiency. The proposed ordering is very effective in reducing the SD complexity, especially at low and moderate SNRs and high modulation orders. The simulation results show that our proposed ordering offers extraordinary advantage over V-BLAST ordering, GB ordering, and BSQR decomposition ordering schemes.

#### Acknowledgments

This paper was supported by Zhejiang Natural Science Foundation (Y1090935) and National Natural Science Foundation of China (60772067). The authors are grateful to the reviewer (s) comments for improving the quality of the paper.

#### References

- P. W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela, “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 (ISSSE '98)*, pp. 295–300, Atlanta, Ga, USA, October 1998. View at: Google Scholar - C. P. Schnorr and M. Euchner, “Lattice basis reduction: improved practical algorithms and solving subset sum problems,”
*Mathematical Programming*, vol. 66, pp. 181–191, 1994. View at: Google Scholar - L. G. Barbero and J. S. Thompson, “Fixing the complexity of the sphere decoder for MIMO detection,”
*IEEE Transactions on Wireless Communications*, vol. 7, no. 6, Article ID 4543065, pp. 2131–2141, 2008. View at: Publisher Site | Google Scholar - X. Wu, Y. Dai, Z. Yan, and Y. Wang, “Improving the reliability of the K-best algorithm for MIMO detection with ordering,” in
*Proceedings of the 19th Annual Wireless and Optical Communications Conference (WOCC '10)*, China, May 2010. View at: Publisher Site | Google Scholar - X. Wu, Y. Dai, Y. Wang, and Z. Yan, “Efficient ordering schemes for high-throughput MIMO detectors,”
*Journal of Signal Processing Systems*, pp. 1–14, 2010. View at: Publisher Site | Google Scholar - R. A. Trujillo, V. M. Garcia, A. M. Vidal, S. Roger, and A. Gonzalez, “A gradient-based ordering for MIMO decoding,” in
*Proceedings of the 9th IEEE International Symposium on Signal Processing and Information Technology (ISSPIT '09)*, pp. 5–8, December 2009. View at: Publisher Site | Google Scholar

#### Copyright

Copyright © 2011 Cao Haiyan and Li Jun. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.