© The Institution of Engineering and Technology
In this study, the authors investigate the expected complexity of increasing radii algorithm (IRA) in an independent and identified distributed Rayleigh fading multipleinput–multipleoutput channel with additive Gaussian noise and then present its upper bound result. IRA employs several radii to yield significant complexity reduction over sphere decoding, whereas performing a nearmaximumlikelihood detection. In contrast to the previous expected complexity presented by Gowaikar and Hassibi (2007), where the radius schedule was hypothetically fixed for analytic convenience, a new analytical result is obtained by considering the usage of multiple radius schedules. The authors analysis reflects the effect of the random variation in the radius schedule and thus provides a more reliable complexity estimation. The numerical results support their arguments, and the analytical results show good agreement with the simulation results.
References


1)

1. Hassibi, B., Vikalo, H.: ‘On the sphere decoding algorithm. Part I: The expected complexity’, IEEE Trans. Signal Process., 2005, 53, (8), pp. 2806–2818.

2)

2. Chang, X.W., Han, Q.: ‘Solving boxconstrained integer least squares problems’, IEEE Trans. Wirel. Commun., 2008, 7, (1), pp. 277–287.

3)

3. Damen, M.O., Gamel, H.E., Caire, G.: ‘On maximumlikelihood detection and the search for the closest lattice point’, IEEE Trans. Inf. Theory, 2003, 49, (10), pp. 2389–2402.

4)

4. Windpassinger, C., Lampe, L., Fischer, R., Hehn, T.: ‘A performance study of MIMO detectors’, IEEE Trans. Wirel. Commun., 2006, 5, (8), pp. 2004–2008.

5)

5. Barbero, L.G., Thompson, J.S.: ‘Performance of the complex sphere decoder in spatially correlated MIMO channels’, IET Commun., 2007, 1, (1), pp. 122–130.

6)

6. Brunel, L.: ‘Multiuser detection techniques using maximum likelihood sphere decoding in multicarrier CDMA systems’, IEEE Trans. Wirel. Commun., 2004, 3, (3), pp. 949–957.

7)

7. Mow, W.: ‘Maximum likelihood sequence estimation from the lattice viewpoint’, IEEE Trans. Inf. Theory, 1994, 40, (5), pp. 1591–1600.

8)

8. Ajtai, M.: ‘The shortest vector problem in L2 is NPhard for randomized reductions’. Proc. 30th Annual ACM Symp. on Theory of Computing, Dallas, TX, USA, May 1998, pp. 10–19.

9)

9. Agrell, E., Eriksson, T., Vardy, A., Zeger, K.: ‘Closest point search in lattices’, IEEE Trans. Inf. Theory, 2002, 48, (8), pp. 2201–2214.

10)

10. Gowaikar, R., Hassibi, B.: ‘Statistical pruning for nearmaximum likelihood decoding’, IEEE Trans. Signal Process., 2007, 55, (6), pp. 2661–2675.

11)

11. Ghaderipoor, A., Tellambura, C.: ‘A statistical pruning strategy for SchnorrEuchner sphere decoding’, IEEE Commun. Lett., 2008, 12, (2), pp. 121–123.

12)

12. Liang, Y., Ma, S., Ng, T.S.: ‘Low complexity nearmaximum likelihood decoding for MIMO systems’. Proc. IEEE PIMRC, Tokyo, Japan, September 2009, pp. 2429–2433.

13)

13. Seethaler, D., Bölcskei, H.: ‘Performance and complexity analysis of infinitynorm spheredecoding’, IEEE Trans. Inf. Theory, 2010, 56, (3), pp. 1085–1105.
http://iet.metastore.ingenta.com/content/journals/10.1049/ietcom.2012.0232
Related content
content/journals/10.1049/ietcom.2012.0232
pub_keyword,iet_inspecKeyword,pub_concept
6
6