Two-level-search sphere decoding algorithm for MIMO detection

ISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems

Volumn , Issue , 2008, Pages 448-452

  Huynh, Trong Anh ^a   Hoang, Dinh Chien ^b   Islam, Mohammad Rakibul ^a   Kim, Jinsang ^a  

^a Kyung Hee University   (South Korea)

^b Ho Chi Minh city of Polytechnic University   (Viet Nam)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; CELLULAR TELEPHONE SYSTEMS; COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; DIFFUSERS (OPTICAL); GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS; MIM DEVICES; MOBILE COMPUTING; MULTIPLEXING; SPHERES; TREES (MATHEMATICS);

BREADTH-FIRST SEARCHES; MIMO DETECTIONS; MULTIPLE INPUT MULTIPLE OUTPUTS; PERFORMANCE GAINS; SEARCH SPACES; SPHERE DECODING; SPHERE DECODING ALGORITHMS; SYMBOL DETECTIONS; TREE SEARCHES; VLSI IMPLEMENTATIONS;

DECODING;

EID: 62449252445     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISWCS.2008.4726096     Document Type: Conference Paper

References (23)

1. G. J. Foschini, "Layered space-time architecture for wireless communication in fading environments when using multiple antennas", Bell Labs, Tech. J., vol. 2, pp. 41-59, 1996.
2. G. J. Foschini Jr. and M. J. Gans, "On limits of wireless communication in a fading environment when using multiple antennas", Wireless Personal Commun., Mar. 1998.
3. S. A. Alamouti, "A simple transmit diversity technique for wireless communication", IEEE J. Select. Areas Commun., vol. 16, pp. 1451-1458, Oct. 1998.
4. P. W. Wolniansky., G. J. Foschini, G. D. Golden, and R. A. Valenzuela. "V-BLAST: An architecture for realizing very high data-rates over the rich scattering widess ehannel", F'roc. IEEE ISSSE-98, Pisa, Italia, 30h September 1998.
5. V. Tarokh, H. Jafarkhani, and A. R. Calderbank, "Space-time block codes from orthogonal designs", IEEE Trans. Inform. Theory, vol. 45, pp. 1456-1467, July 1999.
6. T. L. Marzetta and B. M. Hochwald, "Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading", IEEE Trans. Inform. Theory, vol. 45, pp. 139-157, Jan. 1999.
7. Z. Guo and P. Nilsson, "VLSI implementation issues of lattice decoders for MIMO systems," in Proc. IEEE Int. Symp. Circuits Syst., Vancouver, BC, Canada, May 2004, pp. IV-477-IV-480.
8. D. Garrett, L. Davis, S. ten Brink, and B. Hochwald, "APP processing for high performance MIMO systems," in Proc. IEEE Custom Integrated Circuits Conf., San Jose, CA, Sep. 2003, pp. 271-274.
9. A. Burg, N. Felber, and W. Fichtner, "A 50 mbps 44 maximum likelihood decoder for multiple-input multipleoutput systems with QPSK modulation," in Proc. 10th IEEE Int. Conf. Electron., Circuits, Syst. (ICECS), Dec. 2003, pp. 322-335.
10. C. P. Schnorr and M. Euchner, "Lattice basis reduction: Improving practical lattice basis reduction and solving subset sum problems", Math. Programming, vol. 66, pp. 181-199, 1994.
11. M. 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.
12. B. Hassibi and H. Vikalo, "On the expected complexity of sphere decoding," in Proc. Asilomar Conf. Signals, Syst., Comput., 2001, pp. 1051-1055.
13. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channel", IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1999.
14. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis", Math. Comp., vol. 44, no. 170, pp. 463-471, Apr. 1985.
15. 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.
16. Bakak Hassibi and Haris Vikalo, "On the Sphere-Decoding Algorithm I. Expected Complexity", IEEE Trans. On Signal Processing, vol. 53, no. 8, Aug. 2005.
17. M. O. Damen, H. El Gamal, and G. Caire, "On maximumlikelihood detection and the search for the closest lattice point", IEEE Transactions on Information Theory, vol. 49, no. 10, pp. 2389-2402, Oct. 2003.
18. Q. Liu and L. Yang, "A novel method for initial radius selection of sphere decoding," in Proc. IEEE Veh. Technol. Conf. (VTC)-Fall, vol. 2, Sep. 2004, pp. 1280-1283.
19. D. Garrett, L. Davis, Sten Brink, B Hochwald, and G. Knagge, "Silicon complexity for maximum likelihood MIMO detection using spherical decoding", IEEE J. Solid State Circuits, vol. 39, pp 1544-1552, 2004.
20. Z. Guo and P. Nilson, "Algorithm and Implementation of the K-best sphere decoding for MIMO detection", IEEE Journal on Selected Areas in Communications, vol. 24, pp. 491-503, March 2006.
21. K.-W. Wong, C.-Y. Tsui, R. S.-K. Cheng, and W.-H. Mow, "A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels," in Proc. IEEE Int. Symp. Circuits Syst., May 2002, pp. III-273-III-276.
22. D. L. Ruyet, T. Bertozzi, and B. Özbek, "Breadth first algorithms for APP detectors over MIMO channels," in Proc. IEEE Int. Conf. Commun., Jun. 2004, pp. 926-930.
23. th IEEE Circuits and Systems Symposium on Emerging Technologies, vol. 1, pp. 65-68, June, 2004.