Reduced complexity sphere decoding

Wireless Communications and Mobile Computing

Volumn 11, Issue 12, 2011, Pages 1518-1527

  Li, Boyu ^a   Ayanoglu, Ender ^a  

^a University of California at Irvine   (United States)

Author keywords

low computational complexity; MIMO; ML decoding; SD

Indexed keywords

CODED MIMO SYSTEMS; DECISION-FEEDBACK EQUALIZATIONS; DECODING METRIC; LATTICE REPRESENTATION; MAXIMUM LIKELIHOOD DECODING; MULTIPLE-INPUT-MULTIPLE-OUTPUT SYSTEMS; REDUCED COMPLEXITY; SD; SOFT-BIT; SPHERE DECODING; UNCODED; ZERO-FORCING;

DATA STRUCTURES; DECODING; MAXIMUM LIKELIHOOD; MIMO SYSTEMS; SPHERES;

COMPUTATIONAL COMPLEXITY;

EID: 84655167774     PISSN: 15308669     EISSN: 15308677     Source Type: Journal    
DOI: 10.1002/wcm.1216     Document Type: Conference Paper

References (22)

1. Burg A, Borgmann M, Wenk M, Zellweger M, Fichtner W, Bölcskei H,. VLSI implementation of MIMO detection using the sphere decoding algorithm. IEEE Journal of Solid-State Circuits 2005; 40: 1566-1577.
2. Zimmermann E, Rave W, Fettweis G,. On the complexity of sphere decoding, In Proceedings of the International Conference on Wireless Personal and Multimedia Communications (WPMC 2004), Abano Terme, Italy, 2004.
3. Jaldén J, Ottersten B,. On the complexity of sphere decoding in digital communications. IEEE Transactions on Signal Processing 2005; 53 (4): 1474-1484. (Pubitemid 40535696)
4. Cheng B, Liu W, Yang Z, Li Y,. A new method for initial radius selection of sphere decoding, In Proceedings of the 12th IEEE Symposium on Computers and Communications (ISCC 2007), Aveiro, Portugal, 2007; 19-24.
5. Han HG, Oh SK, Lee SJ, Kwon DS,. Computational complexities of sphere decoding according to initial radius selection schemes and an efficient initial radius reduction scheme, In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2005), St. Louis, MO, USA, 2005; 2354-2358. (Pubitemid 46171540)
6. Hassibi B, Vikalo H,. On the sphere-decoding algorithm I. Expected complexity. IEEE Transactions on Signal Processing 2005; 53 (8): 2806-2818.
7. Zhao W, Giannakis GB,. Sphere decoding algorithms with improved radius search. IEEE Transactions on Communications 2005; 53 (7): 1104-1109. (Pubitemid 41179144)
8. Damen MO, El Gamal H, Caire G,. On maximum-likelihood detection and the search for the closest lattice point. IEEE Transactions on Information Theory 2003; 49 (8): 2389-2402.
9. Rekaya G, Belfiore J,. On the complexity of ML lattice decoders for decoding linear full rate space-time codes, In Proceedings of the IEEE International Symposium on Information Theory (ISIT 2003), Pacifico Yokohama, Kanagawa, Japan, 2003.
10. Azzam L, Ayanoglu E,. Reduced complexity sphere decoding for square QAM via a new lattice representation, In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2007), Washington, DC, USA, 2007; 4242-4246. (Pubitemid 351259792)
11. Azzam L, Ayanoglu E,. Reduced complexity sphere decoding via a reordered lattice representation. IEEE Transactions on Communications 2009; 57 (9): 2564-2569.
12. Wong K, Tsui C, Cheng RS, Mow W,. A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels, In Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS 2002), Scottsdale, Arizona, 2002.
13. Huynh T, Hoang D, Islam MR, Kim J,. Two-level-search sphere decoding algorithm for MIMO detection, In Proceedings of the IEEE International Symposium on Wireless Communication Systems (ISWCS 2008), Reykjavik, Iceland, 2008; 448-452.
14. Hassibi B, Vikalo H,. On the expected complexity of integer least-squares problems, In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2002), Orlando, FL, USA, 2002; 1497-1500.
15. Agrell E, Eriksson T, Vardy A, Zeger K,. Closest point search in lattices. IEEE Transactions on Information Theory 2002; 48 (8): 2201-2214. (Pubitemid 35017061)
16. Studer C, Burg A, Bölcskei H,. Soft-output sphere decoding: algorithms and VLSI implementation. IEEE Journal on Selected Areas in Communications 2008; 26 (2): 290-300. (Pubitemid 351207496)
17. Park HJ, Ayanoglu E,. Bit-interleaved coded multiple beamforming with constellation precoding, In Proceedings of the IEEE International Conference on Communications (ICC 2010), Cape Town, South Africa, 2010.
18. Park HJ, Li B, Ayanoglu E,. Constellation precoded multiple beamforming. IEEE Transactions on Communications 2011; 59 (5): 1275-1286.
19. Park HJ, Li B, Ayanoglu E,. Multiple beamforming with constellation precoding: diversity analysis and sphere decoding, In Proceedings of the IEEE Information Theory and Applications Workshop (ITA 2010), San Diego, CA, USA, 2010.
20. Paulraj A, Nabar R, Gore D,. Introduction to Space-Time Wireless Communication. Cambridge University Press: New York, 2003.
21. Zheng L, Tse DNC,. Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels. IEEE Transactions on Information Theory 2003; 49 (5): 1073-1096.
22. Li B, Ayanoglu E,. Reduced complexity decoding for bit-interleaved coded multiple beamforming with constellation precoding, In Proceedings of the 7th International Wireless Communications and Mobile Computing Conference (IWCMC 2011), Istanbul, Turkey, 2011.