Reduced complexity sphere decoding for square QAM via a new lattice representation

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2007, Pages 4242-4246

  Azzam, Luay ^a   Ayanoglu, Ender ^a  

^a University of California at Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLOATING POINT OPERATIONS PER SECOND (FLOPS); MAXIMUM LIKELIHOOD (ML) DETECTION ALGORITHMS; SPHERE DECODING;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIAL APPROXIMATION; ROUTING ALGORITHMS; THROUGHPUT;

SIGNAL ENCODING;

EID: 39349112353     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2007.807     Document Type: Conference Paper

References (11)

1. A. Burg, M. Borgmann, M. Wenk, M. Zellweger, W. Fichtner, and H. Bolcskei, "VLSI implementation of MIMO detection using the sphere decoding algorithm," IEEE Journal of Solid-State Circuits, vol. 40, pp. 1566-1577, July 2005.
2. E. Zimmermann, W. Rave, and G. Fettweis, "On the complexity of sphere decoding," in Proc. International Symp. on Wireless Pers. Multimedia Commun., Abano Terme, Italy, Sep. 2004.
3. U. Fincke and M.Pohst, "Improved methods for calculating vectors of short length in lattice, including a complexity analysis," Mathematics of Computation, vol. 44, pp. 463-471, April 1985.
4. J. Jaldn and B. Ottersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Processing, vol. 53, no. 4, pp. 1474-1484, April 2005.
5. B. Hassibi and H. Vikalo, "On the sphere-decoding algorithm I. Expected complexity," IEEE Trans. Signal Processing, vol. 53, no. 8, pp. 2806-2818, August 2005.
6. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inform. Theory, vol. 45, no. 5, pp. 1639-1642, July 1999.
7. W. Zhao and G. Giannakis, "Sphere decoding algorithms with improved radius search," IEEE Trans. Commun., vol. 53, no. 7, pp. 1104-1109, July 2005.
8. G. Rekaya and J. Belfiore, "On the complexity of ML lattice decoders for decoding linear full-rate space-time codes," in Proceedings 2003 IEEE International Symposium on Information Theory., July 2003.
9. A. Chan and I. Lee, "A new reduced-complexity sphere decoder for multiple antenna systems," IEEE ICC, vol. 1, pp. 460-464, 2002.
10. B. Hassibi, "A fast square-root implementation for blast," in Proc. Asilomar Conference on Signals, Systems and Computers, vol. 2,Asilomar, USA, Nov. 2000, pp. 1255-1259.
11. K. Wong, C. Tsui, R.-K. Cheng, and W. Mow, "A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels," in Proc. IEEE ISCAS02, vol. 3, pp. 273-276, 2002.