Browse > Article
http://dx.doi.org/10.6109/JKIICE.2009.13.12.2525

Depth-first branch-and-bound-based decoder with low complexity  

Lee, Eun-Ju (KAIST)
Kabir, S.M.Humayun (KAIST)
Yoon, Gi-Wan (KAIST)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.13, no.12, 2009 , pp. 2525-2532 More about this Journal
Abstract
In this paper, a fast sphere decoder is proposed for the joint detection of phase-shift keying (PSK) signals in uncoded Vertical Bell Laboratories Layered Space Time (V-BLAST) systems. The proposed decoder, PSD, consists of preprocessing stage and search stage. The search stage of PSD relies on the depth-first branch-and-bound (BB) algorithm with "best-first" orders stored in lookup tables. Simulation results show that the PSD is able to provide the system with the maximum likelihood (ML) performance at low complexity.
Keywords
space-time coding; multi-input multi-output; maximum likelihood detection; Pham SD;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Pham, K.R. Pattipati, P.K. Willett, and J. Luo, 'An improved complex sphere decoder for V-BLAST systems', IEEE Signal Process. Letter, vol. 11, no. 9, pp. 748-751, Sep. 2004   DOI   ScienceOn
2 T. Cui and C. Tellambura, 'Joint channel estimation and data detection for OFDMsystems via sphere decoding', In IEEE Proc. Globecom'04, vol. 6, pp. 3656-3660, Dec. 2004
3 E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, 'Closest point search in lattices', IEEE Trans. Inform. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002   DOI   ScienceOn
4 M.O. Damen, H.E. Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point", IEEE Trans. Inform. Theory, vol. 49, no. 10, Oct. 2003
5 M.O. Damen, A. Chkeif, and J. Belfiore, 'Lattice code decoder for space-time codes', IEEE Commun. Lett., vol. 4, pp. 161-163, May 2000   DOI   ScienceOn
6 D. Wubben, R. Bohnke, J. Rinas, V. Kuhn, and K. D. Kammeyer, 'Effcient algorithm for decoding layered space-time codes', IEEE Electronics Letters, vol. 37, no.22, pp. 1348-1350, Oct. 2001   DOI   ScienceOn
7 B. Hassibi and H. Vikalo, 'On the sphere-decoding algorithm I. Expected complexity', IEEE Trans. Signal Processing, vol. 53, no. 8, pp. 2806-2818, Aug. 2005   DOI   ScienceOn
8 J. Luo, K. Pattipati, P. Willett, and L. Brunel, 'Branchand-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA', in Proc. IEEE Int. Conf. Commun., vol. 5, pp. 3336-3340, May 2003
9 A.M. Chan and I. Lee, 'A new reduced-complexity sphere decoder for multiple antenna systems', in Proc. IEEE Int. Conf. Commun., vol. 1, pp. 460-464, May 2002
10 E. Viterbo and J. Boutros, 'A universal lattice code decoder for fading channels', IEEE Trans. Inform. Theory, vol. 45, pp. 1639-1642, July 1999   DOI   ScienceOn
11 B.M. Hochwald and S.T. Brink, 'Achieving nearcapacity on a multiple-antenna channel', IEEE Trans. Commun., vol. 51, no. 3, Mar. 2003