Reduced complexity soft-output MIMO sphere detectors-Part I: Algorithmic optimizations

IEEE Transactions on Signal Processing

Volumn 62, Issue 21, 2014, Pages 5505-5520

  Mansour, Mohammad M ^a   Alex, Sam P ^b   Jalloul, Louay M A ^b  

^a AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

^b BROADCOM CORPORATION   (United States)

Author keywords

MIMO detection; Multiple input multiple output (MIMO) communication systems; soft output sphere decoding; VLSI implementation

Indexed keywords

ALGORITHMIC OPTIMIZATION; MIMO DETECTION; MULTIPLE-INPUT MULTIPLE-OUTPUT COMMUNICATION SYSTEMS; REDUCED COMPLEXITY; SOFT OUTPUT; SPHERE DECODING; VLSI IMPLEMENTATION;

EID: 84907855202     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2014.2352595     Document Type: Article

References (41)

1. G. J. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas," Bell Labs Tech. J., vol. 1, no. 2, pp. 41-59, 1996.
2. A. Paulraj,R. Nabar, andD.Gore, Introduction to Space-TimeWireless Communications. Cambridge, U.K.: Cambridge Univ. Press, 2003.
3. G. B. Giannakis, Z. Liu, X. Ma, and S. Zhou, Space-Time Coding for Broadband Wireless Communications. New York, NY, USA: Wiley, 2006.
4. E. Biglieri et al., MIMO Wireless Communications. Cambridge, U.K.: Cambridge Univ. Press, 2007.
5. H. Huang, C. Papadias, and S. Venkatesan, MIMO Communication for Cellular Networks. New York, NY, USA: Springer, 2012.
6. B. Hassibi, "An efficient square-root algorithm for BLAST," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Process. (ICASSP), Istanbul, Turkey, Jun. 2000, pp. 5-9.
7. G. D. Golden, J.G. Foschini, R. A. Valenzuela, and P. W. Wolniansky, "Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture," IEE Electron. Lett., vol. 35, no. 1, pp. 14-15, Jan. 1999.
8. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications," SIGSAM Bull., vol. 15, no. 1, pp. 37-44, Feb. 1981.
9. C. P. Schnorr andM. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Math. Programm., vol. 66, no. 2, pp. 181-191, Sep. 1994.
10. E. Viterbo and E. Biglieri, "A universal decoding algorithm for lattice codes," in Proc. 14ème Colloque GRETSI, Juan-Les-Pins, France, Sep. 1993, pp. 611-614.
11. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639-1642, Jul. 1999.
12. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code decoder for space-time codes," IEEE Commun. Lett., vol. 4, no. 5, pp. 161-163, May 2000.
13. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
14. B. Hassibi and H. Vikalo, "On sphere decoding algorithm. I. Expected complexity," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2806-2818, Aug. 2005.
15. D. Wübben, R. Böhnke, V. Kühn, and K. Kammeyer, "MMSE extension of V-BLAST based on sorted QR decomposition," in Proc. IEEE Vehicular Technol. Conf. (VTC), Orlando, FL, USA, Oct. 2003, pp. 508-512.
16. M. Siti and M. P. Fitz, "A novel soft-output layered orthogonal lattice detector for multiple antenna communications," in Proc. IEEE Int. Conf. Commun. (ICC), Istanbul, Turkey, Jun. 2006, vol. 4, pp. 1686-1691.
17. J. Jaldén and B. Ottersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Process., vol. 53, no. 4, pp. 1474-1484, Apr. 2005.
18. D. Garrett, L. Davis, S. ten Brink, B. Hochwald, and G. Knagge, "Silicon complexity for maximum likelihood MIMO detection using spherical decoding," IEEE J. Solid-State Circuits, vol. 39, no. 9, pp. 1544-1552, Sep. 2004.
19. A. Burg, M. Borgmann,M.Wenk,M. Zellweger,W. Fichtner, and H. Bölcskei, "VLSI implementation of MIMO detection using the sphere decoding algorithm," IEEE J. Solid-State Circuits, vol. 40, no. 7, pp. 1566-1577, Jul. 2005.
20. C. Studer, A. Burg, and H. Bölcskei, "Soft-output sphere decoder: Algorithms andVLSI implementation," IEEE J. Sel. Areas Commun., vol. 26, no. 2, pp. 290-300, Feb. 2008.
21. C. Studer and H. Bölcskei, "Soft-input soft-output single tree-search sphere decoding," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 4827-4842, Oct. 2010.
22. K.-W. Wong, C.-Y. Tsui, R. S.-K. Cheng, and W.-H. Mow, "A VLSI architecture of a-best lattice decoding algorithm for MIMO channels," in Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), Scottsdale, AZ, USA, May 2002, vol. 3, pp. 273-276.
23. R. Wang and G. B. Giannakis, "Approaching MIMO channel capacity with reduced-complexity soft sphere decoding," in Proc. IEEE Wireless Commun. Netw. Conf. (WCNC), Atlanta, GA, USA, Mar. 2004, vol. 3, pp. 1620-1625.
24. Z. Guo and P. Nilsson, "A VLSI architecture of the Schnorr-Euchner decoder for MIMO systems," in Proc. IEEE CAS Symp. Emerg. Technol., Shanghai, China, May 2004, vol. 1, pp. 65-68.
25. C.-A. Shen, A. Eltawil, and K. Salama, "Evaluation framework for-best sphere decoders," J. Circuits, Syst, Comput., vol. 19, no. 5, pp. 975-995, Aug. 2010.
26. S. Mondal, A. Eltawil, C.-A. Shen, and K. Salama, "Design and implementation of a sort free-best sphere decoder," IEEE Trans. VLSI Syst., vol. 18, no. 10, pp. 1497-1501, Oct. 2010.
27. C.-A. Shen, A. Eltawil, K. Salama, and S. Mondal, "A best-first soft/hard decision tree searching MIMO decoder for a 4 4 64-QAM system," IEEE Trans. VLSI Syst., vol. 20, no. 8, pp. 1537-1541, Aug. 2012.
28. D. Wübben, D. Seethaler, J. Jaldén, and G. Matz, "Lattice reduction," IEEE Signal Process. Mag., vol. 28, no. 3, pp. 70-91, May 2011.
29. A. Murugan, H. E. Gamal, M. Damen, and G. Caire, "A unified framework for tree search decoding: Rediscovering the sequential decoder," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 933-953, Mar. 2006.
30. Y. Dai and Z.Yan, "Memory-constrained tree search detection and new ordering schemes," IEEE J. Sel. Topics Signal Process., vol. 3, no. 6, pp. 1026-1037, Dec. 2009.
31. Evolved Universal Terrestrial Radio Access (E-UTRA); Physical Channels and Modulation, 3GPP Std. TS 36.211.
32. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, no. 170, pp. 463-471, Apr. 1985.
33. L. Babai, "On Lovász' lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, no. 1, pp. 1-13, 1986.
34. F. Gray, "Pulse code communications," U.S. Patent No. 2 632 058, Mar. 1953.
35. R. D. Wesel, X. Liu, J. M. Cioffi, and C. Komninakis, "Constellation labeling for linear encoders," IEEE Trans. Inf. Theory, vol. 47, no. 6, pp. 2417-2431, Sep. 2001.
36. D. Wübben, R. Böhnke, J. Rinas, V. Kühn, and K. Kammeyer, "Efficient algorithm for decoding layered space-time codes," IEE Electron. Lett., vol. 37, no. 22, pp. 1348-1350, Oct. 2001.
37. D. W. Waters and J. R. Barry, "The Chase family of detection algorithms for multiple-input multiple-output channels," IEEE Trans. Signal Process., vol. 56, no. 2, pp. 739-747, Feb. 2008.
38. K. Su and I. Wassell, "A new ordering for efficient sphere decoding," in Proc. IEEE Int. Conf. Commun. (ICC), Seoul, Korea,May 2005, vol. 3, pp. 1906-1910.
39. G. H. Golub and C. F. V. Loan, Matrix Computations, 3rd ed. Baltimore, MD, USA: Johns Hopkins Univ. Press, 1996.
40. R. C.-H. Chang, C.-H. Lin, K.-H. Lin, C.-L. Huang, and F.-C. Chen, "Iterative QR decomposition architecture using the modified Gram-Schmidt algorithm for MIMO systems," IEEE Trans. Circuits Syst. I, vol. 57, no. 5, pp. 1095-1102, May 2010.
41. J. Jaldén and B. Ottersten, "Parallel implementation of a soft output sphere decoder," in Proc. Asilomar Conf. Signals, Syst. Comput. (Asilomar), Pacific Grove, CA, USA, Oct./Nov. 2005, pp. 581-585.