Approaching MIMO channel capacity with soft detection based on hard sphere decoding

IEEE Transactions on Communications

Volumn 54, Issue 4, 2006, Pages 587-590

  Wang, Renqui ^a   Giannakis, Georgios B ^a  

^a University of Minnesota   (United States)

Author keywords

Multi input multi output (MIMO) detection; Soft decoding; Sphere decoding; Turbo decoding

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DECODING; DEMODULATION; PHASE SHIFT KEYING; QUADRATURE AMPLITUDE MODULATION; TRANSMITTERS;

MULTI-INPUT MULTI-OUTPUT (MIMO) DETECTION; SOFT DECODING; SPHERE DECODING; TURBO DECODING;

CHANNEL CAPACITY;

EID: 33646010621     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2006.873064     Document Type: Article

References (12)

1. P. Robertson, E. Villebrun, and P. Hoeher, "A comparison of optimal and suboptimal MAP decoding algorithms operating in the log domain," in Proc. Int. Conf. Commun., Seattle, WA, Jun. 1995, pp. 1009-1013.
2. B. M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," IEEE Trans. Commun., vol. 51, no. 3, pp. 389-399, Mar. 2003.
3. A. B. Reid, A. J. Grant, and A. P. Kind, "Low complexity list detection for high-rate MIMO channels," in Proc. 4th Australian Commun. Theory Workshop, Melbourne, Australia, Feb. 2003, pp. 66-69.
4. W. K. Ma, T. N. Davidson, K. M. Wong, Z. Q. Luo, and P. C. Ching, "Quasi-maximum-likelihood multiuser detection using semidefinite relaxation with application to synchronous CDMA," IEEE Trans. Signal Process., vol. 50, no. 4, pp. 912-922, Apr. 2002.
5. C. Schlegel, Trellis Coding. Piscataway, NJ: IEEE Press, 1997.
6. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications," in Proc. ACM SIGSAM, 1981, pp. 37-44.
7. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, pp. 463-471, Apr. 1985.
8. B. Hassibi and H. Vikalo, "On the expected complexity of sphere decoding," in Proc. 35th Asilomar Conf. Signals, Syst., Comput., Pacific Grove, CA, Nov. 2001, pp. 1051-1055.
9. 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.
10. A. Chan and I. Lee, "A new reduced-complexity sphere decoder for multiple antenna systems," in Proc. Int. Conf. Commun., New York, NY, Apr. 28-May 2 2002, vol. 1, pp. 460-464.
11. W. Zhao and G. Giannakis, "Reduced complexity closest point decoding for random lattices," in Proc. 41st Annu. Allerton Conf. Commun. Control, Comput., Monticello, IL, Oct. 2003.
12. J. Luo, K. R. Pattipati, P. K. Willett, and P. Hasegawa, "Near-optimal multiuser detection in synchronous CDMA using probabilistic data association," IEEE Commun. Lett., vol. 5, no. 9, pp. 361-363, Sep. 2001.